566 search results - page 34 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
130
Voted
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
153
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
88
Voted
IRI
2006
IEEE
15 years 6 months ago
2006
IEEE
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...
112
Voted
RSS
2007
15 years 1 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
120
Voted
CP
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...