Sciweavers

1484 search results - page 100 / 297
» Ants meeting algorithms
Sort
View
ANTS
2006
Springer
93views Algorithms» more  ANTS 2006»
15 years 1 months ago
Testing Equivalence of Ternary Cubics
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 ...
Tom Fisher
ANTS
2006
Springer
73views Algorithms» more  ANTS 2006»
15 years 1 months ago
The Elliptic Curve Database for Conductors to 130000
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...
John Cremona
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 10 months ago
A study of ACO capabilities for solving the maximum clique problem
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 ...
Christine Solnon, Serge Fenet
GIS
2006
ACM
15 years 11 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
DATE
2008
IEEE
107views Hardware» more  DATE 2008»
15 years 4 months ago
Instruction Set Extension Exploration in Multiple-Issue Architecture
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...
I-Wei Wu, Zhi-Yuan Chen, Jean Jyh-Jiun Shann, Chun...