3049 search results - page 423 / 610 » On the Convergence of Bound Optimization Algorithms |
125
click to vote
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
123
click to vote
AAAI
2008
15 years 6 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
148
click to vote
JPDC
2010
15 years 2 months ago
2010
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...
238
click to vote
ISCA
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
151
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...