Sciweavers

10106 search results - page 301 / 2022
» Algorithm Selection and Scheduling
Sort
View
PDCAT
2004
Springer
16 years 18 hour ago
Stochastic DFS for Multiprocessor Scheduling of Cyclic Taskgraphs
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
Frode Eika Sandnes, Oliver Sinnen
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 8 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
15 years 6 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis
JSS
2008
65views more  JSS 2008»
15 years 6 months ago
Process pipeline scheduling
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
Melissa Lemos, Marco A. Casanova, Antonio L. Furta...
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
16 years 10 hour ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos