7065 search results - page 84 / 1413 » Iterative Scheduling Algorithms |
132
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
161
click to vote
RTSS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
162
click to vote
WIOPT
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
129
click to vote
WSC
2008
15 years 7 months ago
2008
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
156
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— We present a fast feature selection algorithm suitable for object detection applications where the image being tested must be scanned repeatedly to detected the object of inter...