2157 search results - page 52 / 432 » Binary ant algorithm |
ANTS
2008
Springer
15 years 2 months ago
2008
Springer
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...
120
Voted
ANTS
2008
Springer
15 years 2 months ago
2008
Springer
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...
105
click to vote
ESCIENCE
2006
IEEE
15 years 6 months ago
2006
IEEE
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...
IDA
2005
Springer
15 years 5 months ago
2005
Springer
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...
94
Voted
IEAAIE
2005
Springer
15 years 5 months ago
2005
Springer
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...