Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
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...