On confidence intervals for the number of local optima

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2611, Issue , 2003, Pages 224-235

  Eremeev, Anton V ^a   Reeves, Colin R ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b Institute for Clean Growth and Future Mobility   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES;

CARDINALITIES; CONFIDENCE INTERVAL; LOCAL SEARCH ALGORITHM; LOW AUTOCORRELATION; NK-LANDSCAPES; OPTIMIZATION PROBLEMS; SEARCH SPACES; VERTEX COVER PROBLEMS;

OPTIMIZATION;

EID: 35248819656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_21     Document Type: Article

References (18)

1. Tovey, C.A.: Local Improvement on Discrete Structures. In: Aarts, E., Lenstra, J. K. (eds.): Local Search in Combinatorial Optimization. John Wiley & Sons (1997) 57-90
2. Reeves, C.R.: The Crossover Landscape and the Hamming Landscape for Binary Search Spaces. To appear in Proc. of Foundations of Genetic Algorithms - VII. (2003)
3. Reeves C.R.: Fitness Landscapes and Evolutionary Algorithms. In: Fonlupt, C., Hao, J-K., Lutton, E., Ronald, E. and Schoenauer, M. (eds.): Artificial Evolution: 4th European Conference. Lecture Notes in Computer Science, Vol. 1829. Springer-Verlag, Berlin (2000) 3-20
4. Stadler, P.F.: Towards a Theory of Landscapes. In: Lopéz-Peña, R., Capovilla, R., García-Pelayo, R., Waelbroeck, H. and Zertuche, F. (eds.): Complex Systems and Binary Networks. Springer-Verlag, Berlin (1995) 77-163
5. Reeves, C.R.: Landscapes, Operators and Heuristic Search. Annals of Operations Research. 86 (1999) 473-490
6. Boese, K.D., Kahng, A.B., Muddu S.: A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations. Operations Research Letters. 16 (1994) 101-113
7. Reeves, C.R.: Estimating the Number of Optima in a Landscape, Part I: Statistical Principles. Coventry University Technical Report SOR#01-03 (2001)
8. Garnier, J., Kallel, L.: How to Detect All Maxima of a Function? In: Proceedings of the Second EVONET Summer School on Theoretical Aspects of Evolutionary Computing (Anvers, 1999). Springer, Berlin (2001) 343-370
9. Reeves, C.R.: Estimating the Number of Optima in a Landscape, Part II: Experimental Investigations. Coventry University Technical Report SOR#01-04 (2001)
10. Eremeev, A.V., Reeves C.R.: Non-Parametric Estimation of Properties of Combinatorial Landscapes. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M. and Raidl, G. (eds.): Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2002. Lecture Notes in Computer Science, Vol. 2279. Springer-Verlag, Berlin Heidelberg (2002) 31-40
11. Seber G.A.F.: The Estimation of Animal Abundance. Charles Griffin, London (1982)
12. Mood, A. M., Graybill, F.A., Boes, D.C.: Introduction to the Theory of Statistics. 3rd edn. McGraw-Hill, New York (1973)
13. Johnson, N.L., Kotz, S.: Discrete Distributions. Wiley, New York (1969)
14. Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)
15. Kauffman, S.A.: Adaptation on Rugged Fitness Landscapes. In: Lectures in the Sciences of Complexity, Vol. I of SFI studies, Addison-Wesley (1989) 619-712
16. Golay, M.J. E.: Series for Low-Autocorrelation Binary Sequences. IEEE Trans. Inform. Theory. 23 (1977) 43-51
17. Johnson, D.S., Trick, M.A.: Introduction to the Second DIMACS Challenge: Cliques, Coloring, and Satisfiability. In: Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26. AMS (1996) 1-10
18. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)