Sciweavers

391 search results - page 12 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
JUCS
2007
118views more  JUCS 2007»
13 years 7 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
SETN
2004
Springer
14 years 27 days ago
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
AAAI
1996
13 years 8 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
BPSC
2009
240views Business» more  BPSC 2009»
13 years 8 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
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...
Wolfgang Runte
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 7 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee