Sciweavers

3934 search results - page 379 / 787
» Approximate Schedulability Analysis
Sort
View
WSC
2008
15 years 9 months ago
Speeding up call center simulation and optimization by Markov chain uniformization
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
Eric Buist, Wyean Chan, Pierre L'Ecuyer
CPAIOR
2008
Springer
15 years 8 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
ICML
2010
IEEE
15 years 7 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 6 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 6 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...