277 search results - page 10 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
JAR
2000
13 years 7 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
BPSC
2009
13 years 8 months ago
2009
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...