55 search results - page 9 / 11 » Minimizing total busy time in parallel scheduling with appli... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
ANOR
2010
13 years 5 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...