Sciweavers

2157 search results - page 39 / 432
» Binary ant algorithm
Sort
View
ANTSW
2008
Springer
13 years 9 months ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
Frank Neumann, Dirk Sudholt, Carsten Witt
PREMI
2007
Springer
14 years 2 months ago
Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
Shigeyoshi Tsutsui
IJIS
2007
155views more  IJIS 2007»
13 years 8 months ago
Clustering web search results using fuzzy ants
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
Steven Schockaert, Martine De Cock, Chris Cornelis...
IFIP12
2009
13 years 6 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...
ANTS
2004
Springer
114views Algorithms» more  ANTS 2004»
14 years 1 months ago
Montgomery Scalar Multiplication for Genus 2 Curves
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
Sylvain Duquesne