34 search results - page 7 / 7 » Online Interval Scheduling: Randomized and Multiprocessor Ca... |
MOBIHOC
2007
ACM
14 years 5 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
ALGORITHMICA
2004
13 years 5 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
KR
2010
Springer
13 years 10 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
CONSTRAINTS
1998
13 years 5 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...