Broadcasting is an information dissemination problem in which a message originating at one node of a communication network (modeled as a graph) is to be sent to all other nodes as quickly as possible. This paper describes a new way of producing broadcasting schemes using genetic programming. This technique has proven successful by easily finding optimal algorithms for several well-known families of networks (grids, hypercubes and cycle connected cubes) and has indeed generated a new scheme for butterflies that improves the known upper bound for the broadcasting time of these networks.
Load (this preprint may differ from the actual published paper):
original programs in C++ (ant problem, etc.) from Andy Singleton
programs in C++ for the broadcast problem
BYTE, Feb 94. "Genetic Programming with C++" from Andy Singleton .
A java applet that programs the symbolic regression problem. (local copy) (original)
.Last changed: April 4, 1999. Since March 19, 1998 it has been accessed
Access statistics