436 search results - page 64 / 88 » Ant algorithms and stigmergy |
141
click to vote
EVOW
2006
Springer
15 years 9 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
206
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
131
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-ra...
123
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study p-divisibility of discriminants of Hecke algebras associated to spaces of cusp forms of prime level. By considering cusp forms of weight bigger than 2, we a...
142
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...