71 search results - page 12 / 15 » Optimal online assignment with forecasts |
IPL
2008
13 years 9 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
SIGCOMM
2012
ACM
12 years 8 days ago
2012
ACM
Many large content publishers use multiple content distribution networks to deliver their content, and many industrial systems have become available to help a broader set of conte...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
ICRA
2000
IEEE
14 years 2 months ago
2000
IEEE
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...