HereBoy: A Fast Evolutionary Algorithm

Authors:
Delon Levi
Affiliations:
-
Venue:
EH '00 Proceedings of the 2nd NASA/DoD workshop on Evolvable Hardware
Year:
2000

Citing 0
Cited 10

Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Dependability in an evolving world

Proceedings of the 3rd conference on Computing frontiers
Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

Journal of Parallel and Distributed Computing
Hardware implementation of a novel genetic algorithm

Neurocomputing
A three-step decomposition method for the evolutionary design of sequential logic circuits

Genetic Programming and Evolvable Machines
Research on fault-tolerance of analog circuits based on evolvable hardware

ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
Analog circuit evolution based on FPTA-2

ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
Evolving in extended hamming distance space: hierarchical mutation strategy and local learning principle for EHW

ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
A salient region detector for GPU using a cellular automata architecture

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
A biological development model for the design of robust multiplier

EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

HereBoy is an evolutionary algorithm that combines features from Genetic Algorithms and Simulated Annealing, and adds a new methodology for exploring the search space. It is particularly well suited for exploring large spaces, like those associated with evolvable hardware, although it can be applied to a wide range of search/optimization problems. Experimental data consistently shows that when compared to both Genetic Algorithms and Simulated Annealing, HereBoy requires up to 100X fewer iterations than a Genetic Algorithm and up to 10X fewer iterations than Simulated Annealing. In some cases, HereBoy is able to solve problems to a degree of accuracy that a Genetic Algorithm is unable to achieve. HereBoy also scales from small problems to larger problems significantly better than the other two algorithms.