Free lunches for function and program induction. (English) Zbl 1369.68326
Proceedings of the 10th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2009, Orlando, FL, USA, January 9–11, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-414-0). 183-194 (2009).
MSC:
| 68T20 | Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) |
References:
| [1] | C. Igel and M. Toussaint. On classes of functions for which no free lunch results hold. Information Processing Letters, 86(6):317-321, 2003. 10.1016/S0020-0190(03)00222-9 · Zbl 1162.68816 |
| [2] | C. Igel and M. Toussaint. A no-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms, 3:313-322, 2004. · Zbl 1079.90111 |
| [3] | W. Kirchherr, M. Li, and P. Vitanyi. The miraculous universal distribution. Mathematical Intelligencer, 19:7-15, 1997. · Zbl 0934.01007 |
| [4] | W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002. · Zbl 0993.68039 |
| [5] | R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza). |
| [6] | C. Schumacher, M. D. Vose, and L. D. Whitley. The no free lunch and problem description length. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 565-570. Morgan Kaufmann, 2001. |
| [7] | M. J. Streeter. Two broad classes of functions for which a no free lunch result does not hold. In Proc. Genetic and Evolutionary Computation Conference GECCO-2003, pages 1418-1430. Morgan Kaufmann, 2003. · Zbl 1038.68880 |
| [8] | D. Whitley and J. Rowe. Focused no free lunch theorems. In GECCO’08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 811-818, New York, NY, USA, 2008. ACM. 10.1145/1389095.1389254 |
| [9] | D. Whitley and J. P. Watson. Complexity theory and the no free lunch theorem. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chapter 11, pages 317-339. Springer US, 2005. |
| [10] | D. Wolpert and W. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997. 10.1109/4235.585893 |
| [11] | J. Woodward. GA or GP? that is not the question. In R. Sarker, R. Reynolds, H. Abbass, K. C. Tan, B. McKay, D. Essam, and T. Gedeon, editors, Proceedings of the 2003 Congress on Evolutionary Computation CEC2003, pages 1056-1063, Canberra, 8-12 Dec. 2003. IEEE Press. |
| [12] | J. R. Woodward and J. R. Neil. No free lunch, program induction and combinatorial problems. In C. Ryan, T. Soule, M. Keijzer, E. P. K. Tsang, R. Poli, and E. Costa, editors, Genetic Programming, Proceedings of EuroGP’2003, volume 2610 of LNCS, pages 475-484, Essex, 14-16 Apr. 2003. Springer-Verlag. · Zbl 1033.68655 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
