Towards a complexity theory of randomized search heuristics: Ranking-based black-box complexity

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

Volumn 6651 LNCS, Issue , 2011, Pages 15-28

  Doerr, Benjamin ^a   Winzen, Carola ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK-BOX COMPLEXITY; CLASSICAL METHODS; COMPLEXITY ESTIMATES; COMPLEXITY THEORY; LOW COMPLEXITY; RANDOMIZED SEARCH HEURISTICS; THEORETICAL COMPUTER SCIENCE;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

HEURISTIC ALGORITHMS;

EID: 79959316205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20712-9_2     Document Type: Conference Paper

References (15)

1. Aldous, D.: Minimization algorithms and random walk on the d-cube. Annals of Probability 11, 403-413 (1983)
2. Anil, G., Paul Wiegand, R.: Black-box search by elimination of fitness functions. In: Proc. of Foundations of Genetic Algorithms (FOGA 2009), pp. 67-78. ACM, New York (2009)
3. Doerr, B., Johannsen, D., K̈otzing, T., Lehre, P.K.,Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators, ArXiv eprints 1012.0952 (2010); Foundations of Genetic Algorithms XI FOGA (2011, to appear)
4. Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: Proc. of Foundations of Genetic Algorithms (FOGA 2003), pp. 253-270 (2003)
5. Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems 39, 525-544 (2006) (Pubitemid 43876884)
6. Doerr, B., Winzen, C.: Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity, ArXiv e-prints 1102.1140 (2011)
7. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of np-completeness. W. H. Freeman & Co., New York (1990)
8. Hansen, N.: Private communication (2010)
9. Horn, J., Goldberg, D., Deb, K.: Long path problems. In: Davidor, Y., M̈anner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 149-158. Springer, Heidelberg (1994)
10. Hausmann, D., Korte, B.: Lower bounds on the worst-case complexity of some oracle algorithms. Discrete Math. 24, 261-276 (1978)
11. Hromkovic, J.: Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics, 2nd edn. Springer, New York (2003)
12. Llewellyn, D.C., Tovey, C., Trick, M.: Local optimization on graphs. Discrete Appl. Math. 23, 157-178 (1989) Erratum: 46, 93-94 (1993)
13. Lehre, P.K., Witt, C.: Black-box search by unbiased variation. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2010), pp. 1441-1448. ACM, New York (2010)
14. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)
15. Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: Proc. of 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pp. 222-227 (1977)