Sciweavers

1484 search results - page 61 / 297
» Ants meeting algorithms
Sort
View
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 9 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
TACAS
2010
Springer
151views Algorithms» more  TACAS 2010»
16 years 22 days ago
When Simulation Meets Antichains
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Ho...
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 9 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
GIS
2008
ACM
15 years 5 months ago
An ACS cooperative learning approach for route finding in natural environment
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...
David Brosset, Christophe Claramunt, Eric Saux
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
15 years 10 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler