Inherent fault tolerance in evolved sorting networks

Authors:
Rob Shepherd;James Foster
Affiliations:
Department of Computer Science, University of Idaho, Moscow, ID;Department of Computer Science, University of Idaho, Moscow, ID
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 2
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Representation and Robustness for Evolved Sorting Networks

EH '99 Proceedings of the 1st NASA/DOD workshop on Evolvable Hardware

Intrinsic evolution of sorting networks: a novel complete hardware implementation for FPGAs

ICES'05 Proceedings of the 6th international conference on Evolvable Systems: from Biology to Hardware

Quantified Score

Hi-index	0.00

Visualization

Abstract

This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emerging directly from the evolutionary process, but none has examined the large number of diverse networks we used. Despite a thorough study, the linkage between evolution and increased robustness is unclear.