An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem

Authors:
Meriema Belaidouni;Jin-Kao Hao
Affiliations:
-;-
Venue:
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Year:
2000

Citing 4
Cited 4

Density of States, Metastable States, and Saddle Points: Exploring the Energy Landscape of an RNA Molecule

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
The Density of States - A Measure of the Difficulty of Optimisation Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Scaling Effects in the CSP Phase Transition

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Landscapes and the Maximal Constraint Satisfaction Problem

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution

SAT, Local Search Dynamics and Density of States

Selected Papers from the 5th European Conference on Artificial Evolution
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A survey of techniques for characterising fitness landscapes and some possible ways forward

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an analysis of the configuration space of a well-known combinatorial search problem called MAX-CSP. The analysis is based on a measure called "density of states (d.o.s)". We show experimentally that the configurations of a random MAX-CSP instance follow a normal distribution. This distribution allows us to get some insights about the behavior of a random walk search.