292 search results - page 32 / 59 » Dormant program nodes and the efficiency of genetic programm... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
IWAN
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents the main concepts of the IST Project FAIN "Future Active IP Networks" [10], a three-year collaborative research project, whose main task is to develo...
IJHPCA
2006
13 years 7 months ago
2006
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...