436 search results - page 81 / 88 » Ant algorithms and stigmergy |
ANTS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
Let C be a smooth plane cubic curve with Jacobian E. We give a formula for the action of the 3-torsion of E on C, and explain how it is useful in studying the 3-Selmer group of an ...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...
HEURISTICS
2006
14 years 9 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
78
Voted
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...