Sciweavers

2157 search results - page 22 / 432
» Binary ant algorithm
Sort
View
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
14 years 5 days ago
Computation of Locally Free Class Groups
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
Werner Bley, Robert Boltje
ANTS
2008
Springer
111views Algorithms» more  ANTS 2008»
13 years 10 months ago
Computing L-Series of Hyperelliptic Curves
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
Kiran S. Kedlaya, Andrew V. Sutherland
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
13 years 10 months ago
Construction of Rational Points on Elliptic Curves over Finite Fields
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
Andrew Shallue, Christiaan van de Woestijne
ISCI
2010
175views more  ISCI 2010»
13 years 6 months ago
Clustering web people search results using fuzzy ants
Person name queries often bring up web pages that correspond to individuals sharing the same name. The Web People Search (WePS) task consists of organizing search results for ambi...
Els Lefever, Timur Fayruzov, Véronique Host...
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
14 years 21 days ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim