Sciweavers

2157 search results - page 52 / 432
» Binary ant algorithm
Sort
View
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
13 years 10 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
ANTS
2008
Springer
133views Algorithms» more  ANTS 2008»
13 years 10 months ago
Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
We discuss arithmetic in the Jacobian of a hyperelliptic curve C of genus g. The traditional approach is to fix a point P C and represent divisor classes in the form E - d(P) wher...
Steven D. Galbraith, Michael Harrison, David J. Mi...
ESCIENCE
2006
IEEE
14 years 2 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus
IDA
2005
Springer
14 years 2 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
IEAAIE
2005
Springer
14 years 2 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