17760 search results - page 221 / 3552 » A Generalization of the Massey-Ding Algorithm |
123
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
141
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
153
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
140
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
120
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...