Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Group Properties Of Crossover And Mutation, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
Group Properties Of Crossover And Mutation, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
Computer Science Faculty Publications
It is supposed that the finite search space Ω has certain symmetries that can be described in terms of a group of permutations acting upon it. If crossover and mutation respect these symmetries, then these operators can be described in terms of a mixing matrix and a group of permutation matrices. Conditions under which certain subsets of Ω are invariant under crossover are investigated, leading to a generalization of the term schema. Finally, it is sometimes possible for the group acting on Ω to induce a group structure on Ω itself.
The Single Row Routing Problem Revisited: A Solution Based On Genetic Algorithms, Albert Y. Zomaya, Roger Karpin, Stephan Olariu
The Single Row Routing Problem Revisited: A Solution Based On Genetic Algorithms, Albert Y. Zomaya, Roger Karpin, Stephan Olariu
Computer Science Faculty Publications
With the advent of VLSI technology, circuits with more than one million transistors have been integrated onto a single chip. As the complexity of ICs grows, the time and money spent on designing the circuits become more important. A large, often dominant, part of the cost and time required to design an IC is consumed in the routing operation. The routing of carriers, such as in IC chips and printed circuit boards, is a classical problem in Computer Aided Design. With the complexity inherent in VLSI circuits, high performance routers are necessary. In this paper, a crucial step in the …