Sciweavers

380 search results - page 27 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
AUSAI
2005
Springer
13 years 10 months ago
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
Stuart Bain, John Thornton, Abdul Sattar
JMLR
2010
113views more  JMLR 2010»
13 years 3 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
CP
2009
Springer
14 years 19 hour 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...
AAAI
1996
13 years 10 months ago
A Graph-Based Method for Improving GSAT
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...
Kalev Kask, Rina Dechter
ECAI
2008
Springer
13 years 10 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...