Negative slope coefficient and the difficulty of random 3-SAT instances

Authors:
Marco Tomassini;Leonardo Vanneschi
Affiliations:
Information Systems Department, University of Lausanne, Lausanne, Switzerland;Dipartimento di Informatica, Sistemistica e Comunicazione, University of Milano-Bicocca, Milan, Italy
Venue:
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Year:
2008

Citing 4
Cited 1

Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Negative slope coefficient: a measure to characterize genetic programming fitness landscapes

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

NK Landscapes Difficulty and Negative Slope Coefficient: How Sampling Influences the Results

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an empirical study of the Negative Slope Coefficient (NSC) hardness statistic to characterize the difficulty of 3-SAT fitness landscapes for randomly generated problem instances. NSC correctly classifies problem instances with a low ratio of clauses to variables as easy, while instances with a ratio close to the critical point are classified as hard, as expected. Together with previous results on many different problems and fitness landscapes, the present results confirm that NSC is a useful and reliable indicator of problem difficulty.