Searching for authors named "Thomas Haynes" – sorted by Relevance.
-
Collective Adaption: Explicit Cooperation in a Competitive Computational Agent Society
- Contents 1 Introduction 2 2 Collective Intelligence 6 2.1 Collective Memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2 Computational Agent Society . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Extracting Information from the Chromosomes . . . . . . . . . .
- Add To MetaCart
-
Duplication of Coding Segments in Genetic Programming
- Research into the utility of non--coding segments, or introns, in genetic--based encodings has shown that they expedite the evolution of solutions in domains by protecting building blocks against destructive crossover. We consider a genetic programming system where non--coding segments can be remove
- Cited by 22 (12 self) – Add To MetaCart
-
Collective Memory Search
- Collective action has been examined to expedite search in optimization problems [ Dorigo et al., 1996 ] . Collective memory has been applied to learning in multiagent systems [ Garland and Alterman, 1996 ] . We integrate the simplicity of collective action with the pattern detection of collective me
- Cited by 8 (8 self) – Add To MetaCart
-
On-line Adaptation of Search via Knowledge Reuse
- We have integrated the distributed search of genetic programming based systems with collective memory to form a collective adaptation search method. Such a system significantly improves search as problem complexity is increased. In collective adaptation, search agents gather knowledge of their envir
- Cited by 1 (0 self) – Add To MetaCart
-
Augmenting Collective Adaptation with Simple Process Agents
- We have integrated the distributed search of genetic programming based systems with collective memory to form a collective adaptation search method. Such a system significantly improves search as problem complexity is increased. However, there is still considerable scope for improvement. In collecti
- Cited by 2 (2 self) – Add To MetaCart
-
Clique Detection as a Royal Road Function
- Royal Road functions manipulate the fitness landscape to provide controlled experiments into genetic algorithm (GA) theory [Mitchell et al., 1992]. Variations of clique detection in a graph, e.g., finding both the max clique [Soule et al., 1996] and the clique cover [Haynes, 1996], have been propose
- Cited by 1 (0 self) – Add To MetaCart
-
Phenotypical Building Blocks for Genetic Programming
- The theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the building blocks, highly fit compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) is tenuous, borr
- Cited by 7 (1 self) – Add To MetaCart
-
Collective Memory Search: Exploiting an Information Center for Exploration
- Complex group behavior arises in social insects colonies as the integration of the actions of simple and redundant individual insects [ Adler and Gordon, 1992, Oster and Wilson, 1978 ] . Furthermore, the colony can act as an information center to expedite foraging [ Brown, 1989 ] . We apply these le
- Cited by 2 (1 self) – Add To MetaCart
-
Perturbing the Representation, Decoding, and Evaluation of Chromosomes
- We investigate different genetic algorithm and genetic programming variants of representation, decoding, and evaluation of chromosomes for clique detection in graph. Small changes can drastically impact finding the evolutionary process, making fair comparisons difficult. 1 Introduction While resea
- Add To MetaCart
-
Clique Detection via Genetic Programming
- Genetic programming is applied to the task of finding all of the cliques in a graph. Nodes in the graph are represented as tree structures, which are then manipulated to form candidate cliques. The intrinsic properties of clique detection complicates the design of a good fitness evaluation. We analy
- Cited by 3 (3 self) – Add To MetaCart

