Sciweavers

8125 search results - page 163 / 1625
» Parallelism and evolutionary algorithms
Sort
View
EVOW
2001
Springer
15 years 8 months ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
TPDS
1998
157views more  TPDS 1998»
15 years 3 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 9 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
136
Voted
EH
2003
IEEE
136views Hardware» more  EH 2003»
15 years 8 months ago
Experimental Results in Evolutionary Fault-Recovery for Field Programmable
This paper presents experimental results of fast intrinsic evolutionary design and evolutionary fault recovery of a 4-bit Digital to Analog Converter (DAC) using the JPL stand-alo...
Ricardo Salem Zebulum, Didier Keymeulen, Vu Duong,...
134
Voted
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 4 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur