Sciweavers

942 search results - page 74 / 189
» Distance Constraint Satisfaction Problems
Sort
View
AAAI
1994
14 years 11 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
CP
2009
Springer
15 years 1 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
IRI
2006
IEEE
15 years 4 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
FLAIRS
2003
14 years 11 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin