Defining locality as a problem difficulty measure in genetic programming

ISSN： 1389-2576

Source： Genetic Programming and Evolvable Machines, Vol.12, Iss.4, 2011-12, pp. : 365-401

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Problem Difficulty and Code Growth in Genetic Programming

By Gustafson Steven Ekárt Anikó Burke Edmund Kendall Graham

Genetic Programming and Evolvable Machines, Vol. 5, Iss. 3, 2004-09 ,pp. : 271-290

Springer Publishing Company

Access to resources Recommend Favorite

Combining genetic approach and integer programming to solve multi-facility economic lot-scheduling problem

By Chan Hing

Journal of Intelligent Manufacturing, Vol. 23, Iss. 6, 2012-12 ,pp. : 2397-2405

Springer Publishing Company

Access to resources Recommend Favorite

Open issues in genetic programming

By O'Neill Michael

Genetic Programming and Evolvable Machines, Vol. 11, Iss. 3-4, 2010-09 ,pp. : 339-363

Springer Publishing Company

Access to resources Recommend Favorite

Genetic programming: principles and applications

By Sette S. Boullart L.

Engineering Applications of Artificial Intelligence, Vol. 14, Iss. 6, 2001-12 ,pp. : 727-736

Elsevier

Access to resources Recommend Favorite

Recent Patents on Genetic Programming

Recent Patents on Computer Science, Vol. 2, Iss. 1, 2009-01 ,pp. : 43-49

Bentham Science Publishers

Access to resources Recommend Favorite