1096 search results - page 14 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
EVOW
2010
Springer
15 years 1 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
ISNN
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a new approach to speed up the operation of time delay neural networks for fast code detection. The entire data are collected together in a long vector and then...
MOC
2000
14 years 9 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
3DIM
2001
IEEE
15 years 1 months ago
2001
IEEE
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...