253 search results - page 31 / 51 » Approximation algorithm for the temperature-aware scheduling... |
122
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
106
click to vote
LATIN
2010
Springer
14 years 11 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
115
click to vote
DMIN
2006
15 years 2 months ago
2006
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
114
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
112
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...