Sciweavers

1484 search results - page 26 / 297
» Ants meeting algorithms
Sort
View
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 1 months ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
ANTS
2004
Springer
105views Algorithms» more  ANTS 2004»
14 years 1 months ago
Algorithmic Aspects of Cubic Function Fields
Abstract. This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rati...
Renate Scheidler
ANTSW
2004
Springer
14 years 1 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
GECCO
2009
Springer
130views Optimization» more  GECCO 2009»
14 years 10 days ago
A stigmergy-based algorithm for black-box optimization: noiseless function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 10 days ago
A stigmergy-based algorithm for black-box optimization: noisy function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc