Digital Library
Close Browse articles from a journal
 
<< previous   
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 16 of 16 found articles
 
 
  What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
 
 
Title: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Author: Daida, Jason M.
Bertram, Robert R.
Stanhope, Stephen A.
Khoo, Jonathan C.
Chaudhary, Shahbaz A.
Chaudhri, Omer A.
Polito, John A. II
Appeared in: Genetic programming and evolvable machines
Paging: Volume 2 (2001) nr. 2 pages 165-191
Year: 2001
Contents:
Publisher: Kluwer Academic Publishers, Boston
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 16 of 16 found articles
 
<< previous   
 
 Koninklijke Bibliotheek - National Library of the Netherlands