Subthreshold-Seeking Behavior and Robust Local Search
暂无分享,去创建一个
[1] D. Ackley. A connectionist machine for genetic hillclimbing , 1987 .
[2] L. Darrell Whitley,et al. Evaluating Evolutionary Algorithms , 1996, Artif. Intell..
[3] Joseph C. Culberson,et al. On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.
[4] Joseph Culberson. On the Futility of Blind Search , 1996 .
[5] Patrick D. Surry,et al. Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.
[6] Steffen Christensen,et al. What can we learn from No Free Lunch? a first attempt to characterize the concept of a searchable function , 2001 .
[7] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[8] L. D. Whitley,et al. The No Free Lunch and problem description length , 2001 .
[9] Jan van Leeuwen. Computer Science Today , 1995, Lecture Notes in Computer Science.