1300 search results - page 9 / 260 » Constraint satisfaction problems and global cardinality cons... |
220
click to vote
ASE
1998
15 years 5 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
146
click to vote
AMC
2008
15 years 6 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
143
click to vote
IJCAI
2007
15 years 7 months ago
2007
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...
183
click to vote
SAGA
2001
Springer
15 years 10 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...