Sciweavers

348 search results - page 13 / 70
» Using Constraint Networks on Timelines to Model and Solve Pl...
Sort
View
CP
2005
Springer
14 years 29 days ago
Dimensioning an Inbound Call Center Using Constraint Programming
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouq...
FLAIRS
2006
13 years 8 months ago
Stochastic Deliberation Scheduling using GSMDPs
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...
Kurt D. Krebsbach
CAEPIA
2003
Springer
14 years 19 days ago
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
Federico Barber, Miguel A. Salido, Laura Paola Ing...
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
14 years 4 days ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
CP
2006
Springer
13 years 11 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière