Sciweavers

566 search results - page 31 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
ANOR
2007
108views more  ANOR 2007»
15 years 16 days ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 3 months ago
Output-feedback controlled-invariant polyhedra for constrained linear systems
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...
Carlos Eduardo Trabuco Dórea
98
Voted
PPDP
2009
Springer
15 years 7 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
JAIR
2000
94views more  JAIR 2000»
15 years 6 days ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
CP
2008
Springer
15 years 2 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...