Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Optimization-based Heuristics for Maximal Constraint Satisfaction
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Reversible DAC and other improvements for solving Max-CSP
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
Dynamic Flexible Constraint Satisfaction
Applied Intelligence
Hard, flexible and dynamic constraint satisfaction
The Knowledge Engineering Review
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Computing lower bound for MAX-CSP problems
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
A framework for constructing complete algorithms based on local search
AI Communications - Constraint Programming for Planning and Scheduling
An improvement for the dynamic distributed double guided genetic algorithm for Max-CSPs
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Load Balancing for the Dynamic Distributed Double Guided Genetic Algorithm for MAX-CSPs
International Journal of Artificial Life Research
International Journal of Swarm Intelligence Research
Hi-index | 0.00 |
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, during search, so the two can be combined. Upper bounds are improved by using heuristic repair methods before search to find a good solution quickly, whose cost is used as the initial upper bound. The method for improving lower bounds is an extension of directed arc consistency preprocessing, used in conjunction with forward checking. After computing directed arc consistency counts, inferred counts are computed for all values based on minimum counts for values of adjacent variables that are later in the search order. This inference process can be iterated, so that counts are cascaded from the end to the beginning of the search order, to augment the initial counts. Improvements in time and effort are demonstrated for both techniques using random problems.