Sciweavers

1484 search results - page 86 / 297
» Ants meeting algorithms
Sort
View
COMPSAC
2004
IEEE
14 years 1 months ago
A Development Framework for Rapid Meta-Heuristics Hybridization
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
Hoong Chuin Lau, Wee Chong Wan, Min Kwang Lim, Ste...
MM
2003
ACM
120views Multimedia» more  MM 2003»
14 years 3 months ago
Linking multimedia presentations with their symbolic source documents: algorithm and applications
An algorithm is presented that automatically matches images of presentation slides to the symbolic source file (e.g., PowerPointTM or AcrobatTM ) from which they were generated. T...
Berna Erol, Jonathan J. Hull, Dar-Shyang Lee
TEC
2008
98views more  TEC 2008»
13 years 10 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolutionary tree genetic programming
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
Ján Antolík, William H. Hsu
HM
2005
Springer
97views Optimization» more  HM 2005»
14 years 3 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...