Sciweavers

874 search results - page 105 / 175
» Optimal Scheduling of Contract Algorithms for Anytime Proble...
Sort
View
FOCS
2000
IEEE
15 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
TON
2010
162views more  TON 2010»
14 years 4 months ago
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
Ritesh Madan, Stephen P. Boyd, Sanjay Lall
AIPS
2000
14 years 11 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
TSMC
2011
324views more  TSMC 2011»
14 years 4 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...