6 search results - page 1 / 2 » Almost sure asymptotic optimality for online routing and mac... |
NETWORKS
2010
13 years 3 months ago
2010
CISS
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
IOR
2002
13 years 4 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
JAIR
2006
13 years 4 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...