80 search results - page 2 / 16 » Grouping Techniques for Scheduling Problems: Simpler and Fas... |
AAAI
2000
13 years 6 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
TON
2008
13 years 4 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
MICRO
2006
IEEE
13 years 10 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
EASSS
2001
Springer
13 years 9 months ago
2001
Springer
Having a robot that carries out a task for you is certainly of some help. Having a group of robots seems to be even better because in this case the task may be finished faster and...