Search results for "Dags"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
127	Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg	Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	IC-Scheduling theory, Scheduling dags, Grid computing, Theory, Global computing, Internet-based computing
97	Grzegorz Malewicz, Arnold L. Rosenberg	Batch-Scheduling Dags for Internet-Based Computing.	Euro-Par	2005	DBLP DOI BibTeX RDF
91	Bertran Steinsky	Efficient coding of labeled directed acyclic graphs.	Soft Comput.	2003	DBLP DOI BibTeX RDF	Bayesian network, Rank, Generation, Directed acyclic graph (DAG), Enumeration
87	Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych	Toward a Theory for Scheduling Dags in Internet-Based Computing.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	scheduling dags, dag decomposition, grid computing, theory, global computing, Internet-based computing, Web computing
86	Christoph W. Keßler	Scheduling Expression DAGs for Minimal Register Need.	PLILP	1996	DBLP DOI BibTeX RDF
74	Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg	On Scheduling Expansive and Reductive Dags for Internet-Based Computing.	ICDCS	2006	DBLP DOI BibTeX RDF
74	Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych	On Scheduling Complex Dags for Internet-Based Computing.	IPDPS	2005	DBLP DOI BibTeX RDF
64	Konstantinos Kalpakis, Yaacov Yesha	Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.	Algorithmica	1999	DBLP DOI BibTeX RDF	Tree dags, Mesh array, Scheduling, Parallel computation, Parallel architectures, Communication delay, Multiprocessing, Tree decomposition, Linear array
63	Gennaro Cordasco, Arnold L. Rosenberg	On scheduling dags to maximize area.	IPDPS	2009	DBLP DOI BibTeX RDF
63	Hatem M. El-Boghdadi, Mohamed Bohalfaeh	Code Generation: On the Scheduling of DAGs Using Worm-Partition.	IPDPS	2007	DBLP DOI BibTeX RDF
63	Radu Calinescu	Bulk Synchronous Parallel Scheduling of Uniform Dags.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
52	Charanjit S. Jutla	PRF Domain Extension Using DAGs.	TCC	2006	DBLP DOI BibTeX RDF
52	Arnold L. Rosenberg, Matthew Yurkewych	Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	reduction computations, convolutional computations, mesh-structured computations, tree-structured computations, scheduling, grid computing, global computing, Internet-based computing, Web computing
52	Eyal Gordon, Adi Rosén	Competitive weighted throughput analysis of greedy protocols on DAGs.	PODC	2005	DBLP DOI BibTeX RDF
45	Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg	Extending IC-Scheduling via the Sweep Algorithm.	PDP	2008	DBLP DOI BibTeX RDF	IC-Scheduling Theory, gridcomputing, globalcomputing, schedulingDAGs, Internet-based computing
45	Jean-Claude Bermond, Michel Cosnard	Minimum number of wavelengths equals load in a DAG without internal cycle.	IPDPS	2007	DBLP DOI BibTeX RDF
45	Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz 0001, April Kwong, Stuart G. Stubblebine	A General Model for Authenticated Data Structures.	Algorithmica	2004	DBLP DOI BibTeX RDF	Authentic publication, Security, Data structures, Database integrity
41	Grzegorz Malewicz	Parallel scheduling of complex dags under uncertainty.	SPAA	2005	DBLP DOI BibTeX RDF	algorithms and theory, probabilistic failures, scheduling of dags, grid computing, combinatorial optimization, project management, resource constraints
40	Matthias Baumgart 0001, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak	All-Pairs Ancestor Problems in Weighted Dags.	ESCAPE	2007	DBLP DOI BibTeX RDF
40	Royi Ronen, Oded Shmueli	Conjunctive Queries over DAGs.	NGITS	2006	DBLP DOI BibTeX RDF
40	Henan Zhao, Rizos Sakellariou	Scheduling multiple DAGs onto heterogeneous systems.	IPDPS	2006	DBLP DOI BibTeX RDF
40	Lutz Priese	Semi-rational Sets of DAGs.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
40	Ankur Kamthe, Soo-Young Lee	A Stochastic Approach to Estimating Earliest Start Times of Nodes for Scheduling DAGs on Heterogeneous Distributed Computing Systems.	IPDPS	2005	DBLP DOI BibTeX RDF
40	Arnold L. Rosenberg	On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives.	IPDPS	2003	DBLP DOI BibTeX RDF
40	Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frédéric Vivien	Retiming DAGs [direct acyclic graph].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
35	Antoine Genitrini, Martin Pépin, Alfredo Viola	Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling.	LAGOS	2021	DBLP DOI BibTeX RDF
35	Kamil Khadiev, Liliya Safina	Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs.	UCNC	2019	DBLP DOI BibTeX RDF
35	Barbara Fila, Siva Anantharaman	Automata for Positive Core XPath Queries on Compressed Documents.	LPAR	2006	DBLP DOI BibTeX RDF	Tree grammars, Dags, Core XPath, XML, Automata
35	Ana Maria Madrigal, Jim Q. Smith	Causal Identification in Design Networks.	MICAI	2004	DBLP DOI BibTeX RDF	Design interventions and strategies, Identification of Policy Effects, Confounders, Directed Acyclic Graphs (DAGs), Influence diagrams, Causal inference, Bayesian decision theory
35	Yves Caniou, Emmanuel Jeannot	Experimental Study of Multi-criteria Scheduling Heuristics for GridRPC Systems.	Euro-Par	2004	DBLP DOI BibTeX RDF	time-shared and heterogeneous resources, dynamic scheduling heuristics, historical trace manager, completion dates estimations, DAGs
35	Moreno Coli, Paolo Palazzari	Global execution time minimization by allocating tasks in parallel systems.	PDP	1995	DBLP DOI BibTeX RDF	global execution time minimization, heuristic criterion, starting population, static allocation, genetic algorithms, genetic algorithm, computational complexity, resource allocation, parallel machines, parallel machine, directed graphs, directed acyclic graphs, DAGs, processor scheduling, parallel systems, task allocation, NP-complete problem, execution time, minimisation, cost function, critical path, precedence relations, critical path analysis
34	Sinisa Todorovic, Narendra Ahuja	Region-Based Hierarchical Image Matching.	Int. J. Comput. Vis.	2008	DBLP DOI BibTeX RDF	Edit-distance graph matching, Many-to-many matching, Maximum subtree isomorphism, Image matching, Transitive closures, Segmentation trees, Maximum weight cliques, Association graphs
34	Yoginder S. Dandass, Amit C. Bugde	Comparison of genetic representation schemes for scheduling soft real-time parallel applications.	GECCO	2006	DBLP DOI BibTeX RDF	genetic list scheduling, soft real-time scheduling, genetic algorithms
34	Zvi Lotker, Boaz Patt-Shamir	Average-Case Analysis of Greedy Packet Scheduling.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
34	S. K. Michael Wong, Dan Wu 0006, Tao Lin 0012	A Structural Characterization of DAG-Isomorphic Dependency Models.	AI	2002	DBLP DOI BibTeX RDF
34	Zvi Lotker, Boaz Patt-Shamir	Average-case analysis of greedy packet scheduling (extended astract).	PODC	2000	DBLP DOI BibTeX RDF
34	Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie	Competitive Implementation of Parallel Programs.	Algorithmica	1999	DBLP DOI BibTeX RDF	Scheduling, Parallel computation, Compiler, Competitive analysis, Communication delay
34	Sekhar Darbha, Dharma P. Agrawal	Optimal Scheduling Algorithm for Distributed-Memory Machines.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	task scheduling, Directed acyclic graph, distributed-memory machines, task duplication, optimal scheduling algorithms
34	David A. Berson, Rajiv Gupta 0001, Mary Lou Soffa	Integrated Instruction Scheduling and Register Allocation Techniques.	LCPC	1998	DBLP DOI BibTeX RDF
34	Gyung-Leen Park, Behrooz A. Shirazi, Jeff Marquis, Hyunseung Choo	Decisive Path Scheduling: A New List Scheduling Method.	ICPP	1997	DBLP DOI BibTeX RDF
34	Flemming Andersen, Kim Dam Petersen, Jimmi S. Pettersson	A Graphical Tool for Proving Unity Progress.	TPHOLs	1994	DBLP DOI BibTeX RDF
34	Apostolos Gerasoulis, Sesh Venugopal, Tao Yang 0009	Clustering task graphs for message passing architectures.	ICS	1990	DBLP DOI BibTeX RDF
29	Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak	A Path Cover Technique for LCAs in Dags.	SWAT	2008	DBLP DOI BibTeX RDF
29	Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg	On Clustering Tasks in IC-Optimal Dags.	ICPP	2008	DBLP DOI BibTeX RDF
29	Stefan Eckhardt, Andreas Michael Mühling, Johannes Nowak	Fast Lowest Common Ancestor Computations in Dags.	ESA	2007	DBLP DOI BibTeX RDF
29	Lutz Priese	Finite Automata on Unranked and Unordered DAGs.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF	regular dag languages, directed acyclic graphs, finite state automata
29	Michael A. Bender, Cynthia A. Phillips	Scheduling DAGs on asynchronous processors.	SPAA	2007	DBLP DOI BibTeX RDF	asynchronous parallel computing, firing-squad scheduling, precedence-constrained scheduling, online scheduling
29	Olin Shivers, Mitchell Wand	Bottom-Up beta-Reduction: Uplinks and lambda-DAGs.	ESOP	2005	DBLP DOI BibTeX RDF
29	Irit Katriel	Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.	CPAIOR	2004	DBLP DOI BibTeX RDF
29	Lascelles Adams, James F. Courtney	Achieving Relevance in IS Research via the DAGS Framework.	HICSS	2004	DBLP DOI BibTeX RDF
29	Micah Adler, Adi Rosén	Tight Bounds for the Performance of Longest-in-System on DAGs.	STACS	2002	DBLP DOI BibTeX RDF
29	Luis M. de Campos, Juan M. Fernández-Luna, José Miguel Puerta	Local Search Methods for Learning Bayesian Networks Using a Modified Neighborhood in the Space of DAGs.	IBERAMIA	2002	DBLP DOI BibTeX RDF
29	Min-You Wu, Wei Shu, Yong Chen	Runtime Parallel Incremental Scheduling of DAGs.	ICPP	2000	DBLP DOI BibTeX RDF
29	Peter Becker 0001	A Temporal Logic Based Approach for Querying Lists, Trees, and DAGs in Databases	DEXA	1995	DBLP DOI BibTeX RDF
24	Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde	A Tool for Prioritizing DAGMan Jobs and its Evaluation.	J. Grid Comput.	2007	DBLP DOI BibTeX RDF	dags, applications of theory, scheduling, Grid, systems, Condor, unpredictability
24	Mourad Hakem, Franck Butelle	Reliability and Scheduling on Systems Subject to Failures.	ICPP	2007	DBLP DOI BibTeX RDF	precedence task graphs, directed acyclic graphs DAGs, clustering, scheduling, reliability, distributed computing, heterogeneous systems, multicriteria scheduling
24	Yangjun Chen	A new algorithm for computing transitive closures.	SAC	2004	DBLP DOI BibTeX RDF	DAGs, transitive closure, branching, topological order
24	Jie Wu 0001, Fei Dai 0001	An Extended Link Reversal Protocol in Dynamic Networks.	IPDPS	2003	DBLP DOI BibTeX RDF	spanning shortest path trees (SPT), Temporally-Ordered Routing Algorithm (TORA), sensor networks, Directed acyclic graphs (DAGs), dynamic networks
24	Evripidis Bampis, Charles Delorme, Jean-Claude König	Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).	STACS	1996	DBLP DOI BibTeX RDF	scheduling, communication, grids, DAGs
24	Tao Yang 0009, Apostolos Gerasoulis	DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
23	Yinglong Xia, Viktor K. Prasanna	Collaborative scheduling of DAG structured computations on multicore processors.	Conf. Computing Frontiers	2010	DBLP DOI BibTeX RDF	dag structured computations, lock free structures, task sharing, collaborative scheduling
23	Ashish Kundu, Elisa Bertino	How to authenticate graphs without leaking.	EDBT	2010	DBLP DOI BibTeX RDF
23	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy	Planar and Grid Graph Reachability Problems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
23	Pushpa Kumar, Kang Zhang 0001	Visualization of clustered directed acyclic graphs with node interleaving.	SAC	2009	DBLP DOI BibTeX RDF	node interleaving, overlapping nodes, visualization, graph drawing, directed acyclic graphs
23	Stefan Schirra	Much Ado about Zero.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF	zero separation bound, exact geometric computation paradigm, real algebraic number computation
23	Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry	3-HOP: a high-compression indexing scheme for reachability query.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	2-hop, 3-hop, path-tree, transitive closure, graph indexing, reachability queries
23	Akio Fujiyoshi	Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.	CIAA	2009	DBLP DOI BibTeX RDF
23	Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sarangi	Theoretical Framework for Eliminating Redundancy in Workflows.	IEEE SCC	2009	DBLP DOI BibTeX RDF
23	Julien Robert, Nicolas Schabanel	Non-clairvoyant scheduling with precedence constraints.	SODA	2008	DBLP BibTeX RDF	equi-partition, non-clairvoyant algorithm, fairness, online scheduling, precedences
23	Sascha Hunold, Thomas Rauber, Frédéric Suter	Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing.	CCGRID	2008	DBLP DOI BibTeX RDF	dag scheduling, mixed-parallelism, clusters of clusters, workflow scheduling
23	Mauricio Solar	A Scheduling Algorithm to Optimize Parallel Processes.	SCCC	2008	DBLP DOI BibTeX RDF
23	Pierre-Yves Koenig, Guy Melançon, Charles Bohan, Berengere Gautier	Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data.	IV	2007	DBLP DOI BibTeX RDF
23	Fabrizio Frati	On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.	WG	2007	DBLP DOI BibTeX RDF
23	Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding	Cost-Based Query Optimization for Multi Reachability Joins.	DASFAA	2007	DBLP DOI BibTeX RDF
23	Massimiliano Mascherini, Federico M. Stefanini	Using Weak Prior Information on Structures to Learn Bayesian Networks.	KES (1)	2007	DBLP DOI BibTeX RDF	Prior information, Bayesian Networks, structural learning
23	Didier Rémy, Boris Yakobowski	A graphical presentation of MLF types with a linear-time unification algorithm.	TLDI	2007	DBLP DOI BibTeX RDF	system SF, graphs, types, unification, binders, MLF
23	Vida Dujmovic, David R. Wood	Upward Three-Dimensional Grid Drawings of Graphs.	Order	2006	DBLP DOI BibTeX RDF	grid drawing, three dimensional graph drawing, upward drawing, track layout, upward track layout, upward queue layout, strong star colouring, harmonious colouring, graph drawing
23	Fabio Aiolli, Giovanni Da San Martino, Alessandro Sperduti, Alessandro Moschitti	Fast On-line Kernel Learning for Trees.	ICDM	2006	DBLP DOI BibTeX RDF
23	Kun-Feng Lin, Chuan-Ming Liu	Broadcasting dependent data with minimized access latency in a multi-channel environment.	IWCMC	2006	DBLP DOI BibTeX RDF	broadcasting, latency, NP-hard, DAG, multiple channels
23	Kun-Feng Lin, Chuan-Ming Liu	Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels.	SUTC (1)	2006	DBLP DOI BibTeX RDF
23	Johann Eder, Karl Wiggisser	A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing.	ER (Workshops)	2006	DBLP DOI BibTeX RDF
23	Doruk Bozdag, Ümit V. Çatalyürek, Füsun Özgüner	A task duplication based bottom-up scheduling algorithm for heterogeneous environments.	IPDPS	2006	DBLP DOI BibTeX RDF
23	E. Ilavarasan, P. Thambidurai	Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System.	DFMA	2005	DBLP DOI BibTeX RDF
23	José A. Gámez 0001, José Miguel Puerta	Constrained Score+(Local)Search Methods for Learning Bayesian Networks.	ECSQARU	2005	DBLP DOI BibTeX RDF
23	Silke Trißl, Ulf Leser	Querying Ontologies in Relational Database Systems.	DILS	2005	DBLP DOI BibTeX RDF
23	Benedikt Bollig	On the Expressiveness of Asynchronous Cellular Automata.	FCT	2005	DBLP DOI BibTeX RDF
23	Chad E. Brown	Reasoning in Extensional Type Theory with Equality.	CADE	2005	DBLP DOI BibTeX RDF
23	Nik Swoboda, Gerard Allwein	Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference.	Softw. Syst. Model.	2004	DBLP DOI BibTeX RDF	Euler and Venn diagrams, Graph transformation, Diagrammatic reasoning, Proof verification
23	Bertran Steinsky	Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Labelled essential directed acyclic graph, Chain graph, Asymptotic enumeration, Bayesian network
23	Brent Heeringa, Micah Adler	Optimal Website Design with the Constrained Subtree Selection Problem.	ICALP	2004	DBLP DOI BibTeX RDF
23	Till Tantau	A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.	STACS	2004	DBLP DOI BibTeX RDF
23	Xuan-Ha Vu, Hermann Schichl, Djamila Sam-Haroud	Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems.	ICTAI	2004	DBLP DOI BibTeX RDF
23	Guodong Li, Daoxu Chen, Daming Wang, Defu Zhang	Task Clustering and Scheduling to Multiprocessors with Duplication.	IPDPS	2003	DBLP DOI BibTeX RDF
23	Peter R. Cappello, Ömer Egecioglu	Automatic Processor Lower Bound Formulas for Array Computations.	ISPAN	2002	DBLP DOI BibTeX RDF	Array computation, Diophantine system, lower bound
23	Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl	Parallel processor scheduling with delay constraints.	SODA	2001	DBLP BibTeX RDF
23	Sekhar Darbha, Dharma P. Agrawal	A Duplication Based Compile Time Scheduling Method for Task Parallelism.	Compiler Optimizations for Scalable Parallel Systems Languages	2001	DBLP DOI BibTeX RDF
23	Ali Shokoufandeh, Sven J. Dickinson	Graph-Theoretical Methods in Computer Vision.	Theoretical Aspects of Computer Science	2000	DBLP DOI BibTeX RDF
23	Eleftherios D. Polychronopoulos, Theodore S. Papatheodorou	Scheduling User-Level Threads on Distributed Shared-Memory Multiprocessors.	Euro-Par	1999	DBLP DOI BibTeX RDF
23	Yossi Matias, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp, Jacob Ziv	Augmenting Suffix Trees, with Applications.	ESA	1998	DBLP DOI BibTeX RDF
23	Yu-Kwong Kwok, Ishfaq Ahmad	A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling