Sciweavers

820 search results - page 13 / 164
» A Search Algorithm for Global Optimisation
Sort
View
ESCIENCE
2007
IEEE
15 years 3 months ago
Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant c...
Marcus Randall, Andrew Lewis, Amir Galehdar, David...
IEAAIE
2005
Springer
15 years 5 months ago
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
James Montgomery, Marcus Randall, Tim Hendtlass
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 5 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
JGO
2010
89views more  JGO 2010»
14 years 10 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
ICML
2007
IEEE
16 years 9 days ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi