Subthreshold-seeking behavior and robust local search

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

Volumn 3103, Issue , 2004, Pages 282-293

  Whitley, Darrell ^a   Bush, Keith ^a   Rowe, Jonathan ^b  

^a Department of Computer Science   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

BENCH-MARK PROBLEMS; BIT PRECISION; GRAY CODES; LOCAL SEARCH; SEARCH ALGORITHMS; SEARCH EFFICIENCY; SIMPLE MODIFICATIONS; SUBTHRESHOLD;

ALGORITHMS;

EID: 35048863831     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_25     Document Type: Article

References (7)

1. Christensen, S., (2001), F.O.: What can we learn from No Free Lunch? In: GECCO-Ol, Morgan Kaufmann (2001) 1219-1226
2. Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating Evolutionary Algorithms. Artificial Intelligence Journal 85 (1996) 1-32
3. Ackley, D.: A Connectionist Machine for Genetic Hillclimbing. Kluwer Academic Publishers (1987)
4. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 4 (1997) 67-82
5. Radcliffe, N., Surry, P.: Fundamental limitations on search algorithms: Evolutionary computing in perspective. In van Leeuwen, J., ed.: Lecture Notes in Computer Science 1000. Springer-Verlag (1995)
6. Culberson, J.: On the Futility of Blind Search. Evolutionary Computation 6(2) (1998) 109-127
7. Schumacher, C., Vose, M., Whitley, D.: The No Free Lunch and Problem Description Length. In: GECCO-01, Morgan Kaufmann (2001) 565-570