Sciweavers

346 search results - page 53 / 70
» Solving quantified constraint satisfaction problems
Sort
View
69
Voted
CP
2007
Springer
15 years 6 months ago
Solution Directed Backjumping for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
Fahiem Bacchus, Kostas Stergiou
AIPS
2006
15 years 1 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
85
Voted
FLAIRS
2003
15 years 1 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
115
Voted
KI
2002
Springer
15 years 3 days ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
101
Voted
AAI
2006
106views more  AAI 2006»
15 years 15 days ago
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
Edmund K. Burke, Patrick De Causmaecker, Sanja Pet...