1095 search results - page 90 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
100
click to vote
JUCS
2002
14 years 9 months ago
2002
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
C3S2E
2010
ACM
14 years 11 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
PDPTA
2004
14 years 11 months ago
2004
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
CODES
2009
IEEE
14 years 11 months ago
2009
IEEE
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...