Now showing items 1-10 of 10
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 ...
Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
(Springer-Verlag; Springer-Verlag New York Inc., 1992-12)
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for ...
Mapping freeze/thaw boundaries with SMMR data
(Elsevier, 1990-08)
Nimbus 7 SMMR data are used to map daily freeze/thaw patterns in the upper Midwest for the fall of 1984. The combination of a low 37 GHz radiobrightness and a negative 10.7, 18 and 37 GHz spectral gradient, [part]Tb/[part]f, ...
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 ...
Discrete and Continuous Representations of Unobserved Heterogeneity in Choice Modeling
(Kluwer Academic Publishers; Springer Science+Business Media, 1999-08)
We attempt to provide insights into how heterogeneity has been and can be addressed in choice modeling. In doing so, we deal with three topics: Models of heterogeneity, Methods of estimation and Substantive issues. In ...
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 ...
Computing convexity properties of images on a pyramid computer
(Springer-Verlag; Springer-Verlag New York Inc., 1991-12)
We present efficient parallel algorithms for using a pyramid computer to determine convexity properties of digitized black/white pictures and labeled figures. Algorithms are presented for deciding convexity, identifying ...