Now showing items 1-6 of 6
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
(Kluwer Academic Publishers; Springer Science+Business Media, 2001-06)
This paper addresses the issue of what makes a problem genetic programming (GP)-hard by considering the binomial-3 problem. In the process, we discuss the efficacy of the metaphor of an adaptive fitness landscape to explain ...
Supporting divide-and-conquer algorithms for image processing
(Elsevier, 1987-02)
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural ...
Embeddings in hypercubes
(Elsevier, 1988)
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication ...
Visualizing Tree Structures in Genetic Programming
(Kluwer Academic Publishers; Springer Science + Business Media, Inc., 2005-03)
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees even though several thousands of nodes may be involved. ...
Intensive hypercube communication Prearranged communication in link-bound machines,
(Elsevier, 1990-10)
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposing a matrix, histogramming, sending a (long) message from one node to another, broadcasting a message from one node to all ...