Sciweavers

1045 search results - page 92 / 209
» Genetic Simulation Library
Sort
View
EVOW
2001
Springer
15 years 10 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...
ECAL
2007
Springer
16 years 9 days ago
On the Adaptive Disadvantage of Lamarckianism in Rapidly Changing Environments
Using a simple simulation model of evolution and learning this paper provides some evolutionary arguments on why Lamarckianlike inheritance - direct transfer of lifetime learning r...
Ingo Paenke, Bernhard Sendhoff, Jon Rowe, Chrisant...
AUSAI
1999
Springer
15 years 10 months ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall
ALIFE
2011
14 years 9 months ago
Interactive Evolution of Camouflage
This paper presents an abstract computation model of the evolution of camouflage in nature. The 2d model uses evolved textures for prey, a background texture representing the envi...
Craig Reynolds
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 5 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane