Sciweavers

3934 search results - page 32 / 787
» Approximate Schedulability Analysis
Sort
View
CP
2005
Springer
14 years 3 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
WSC
2007
14 years 2 days ago
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
Warren B. Powell
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
14 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
MOBIHOC
2005
ACM
14 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
WSC
2008
14 years 2 days ago
A simulation based scheduling model for call centers with uncertain arrival rates
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
Thomas R. Robbins, Terry P. Harrison