955 search results - page 56 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
ECAI
2000
Springer
14 years 10 days ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
CONSTRAINTS
2008
13 years 8 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
FLAIRS
2008
13 years 10 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...