Methods of Automatic Algorithm Generation

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{bain04methods,

• author = "Stuart Bain and John Thornton and Abdul Sattar",
• title = "Methods of Automatic Algorithm Generation",
• booktitle = "8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004",
• year = "2004",
• editor = "Chengqi Zhang and Hans W. Guesgen and Wai-Kiang Yeap",
• volume = "3157",
• series = "Lecture Notes in Computer Science",
• pages = "144--153",
• address = "Auckland, New Zealand",
• month = aug # " 9-13",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming, CSP",
• isbn13 = "978-3-540-22817-2",
• URL = "http://www.ict.griffith.edu.au/~johnt/publications/PRICAI2004stuart.pdf",
• DOI = "doi:10.1007/978-3-540-28633-2_17",
• size = "10 pages",
• abstract = "Many methods have been proposed to automatically generate algorithms for solving constraint satisfaction problems. The aim of these methods has been to overcome the difficulties associated with matching algorithms to specific constraint satisfaction problems. This paper examines three methods of generating algorithms: a randomised search, a beam search and an evolutionary method. The evolutionary method is shown to have considerably more flexibility than existing alternatives, being able to discover entirely new heuristics and to exploit synergies between heuristics.",
• notes = "uf100-01.cnf",

}

Genetic Programming entries for Stuart Bain John Thornton Abdul Sattar

Citations