Sciweavers

1484 search results - page 10 / 297
» Ants meeting algorithms
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 27 days ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
ICNS
2007
IEEE
14 years 2 months ago
Ant Routing in Mobile Ad Hoc Networks
We study the performance of ant routing for static and dynamic network topologies. We also compare the performance of ant routing with AODV and DSR for ad hoc networks. The simula...
S. S. Dhillon, X. Arbona, Piet Van Mieghem
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
JCST
2008
134views more  JCST 2008»
13 years 7 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
AE
2005
Springer
14 years 1 months ago
A New Classification-Rule Pruning Procedure for an Ant Colony Algorithm
This work proposes a new rule pruning procedure for Ant-Miner, an Ant Colony algorithm that discovers classification rules in the context of data mining. The performance of Ant-Min...
Allen Chan, Alex Alves Freitas