1292 search results - page 90 / 259 » Revisiting the optimal scheduling problem |
144
click to vote
CEC
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
103
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
116
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
142
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
152
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...