874 search results - page 91 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
138
click to vote
MOR
2000
15 years 3 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
123
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
117
click to vote
DAM
1998
15 years 3 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
124
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
129
click to vote
TON
2010
15 years 2 months ago
2010
—In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequen...