66 search results - page 7 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
150
Voted
TIME
2002
IEEE
15 years 9 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
136
click to vote
JAIR
2010
15 years 2 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
122
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
ECAL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
125
click to vote
AAAI
1996
15 years 5 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...