Sciweavers

3569 search results - page 522 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
PPSN
2010
Springer
15 years 5 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
CEC
2009
IEEE
16 years 1 months ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang
ATAL
2009
Springer
16 years 1 months ago
A memetic framework for describing and simulating spatial prisoner's dilemma with coalition formation
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
Juan C. Burguillo-Rial
CIBCB
2007
IEEE
16 years 28 days ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret