Sciweavers

238 search results - page 40 / 48
» Planning as Satisfiability
Sort
View
PUK
2001
13 years 11 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
SOQUA
2007
13 years 11 months ago
Faults' context matters
When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evalua...
Jaymie Strecker, Atif M. Memon
ECAI
2010
Springer
13 years 11 months ago
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
Cédric Pralet, Gérard Verfaillie, Mi...
CCE
2008
13 years 10 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
ANOR
2004
122views more  ANOR 2004»
13 years 9 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...