|
Volumn 1, Issue , 1994, Pages 154-159
|
On the use of a directed acyclic graph to represent a population of computer programs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTER SOFTWARE;
DATA STRUCTURES;
FUNCTION EVALUATION;
MATHEMATICAL PROGRAMMING;
RANDOM PROCESSES;
SOFTWARE ENGINEERING;
STORAGE ALLOCATION (COMPUTER);
TREES (MATHEMATICS);
DIRECTED ACYCLIC GRAPH;
FITNESS CASE INDEXED CACHING;
GENETIC PROGRAMMING;
PARSE TREES POPULATION;
GRAPH THEORY;
|
EID: 0028573419
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (50)
|
References (2)
|