Sciweavers

942 search results - page 52 / 189
» Distance Constraint Satisfaction Problems
Sort
View
CP
1999
Springer
14 years 2 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
CP
2006
Springer
14 years 1 months ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...
AIMSA
2008
Springer
13 years 11 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
CSCLP
2003
Springer
14 years 3 months ago
Implementing Propagators for Tabular Constraints
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Roman Barták, Roman Mecl
CSL
2008
Springer
13 years 11 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona