4112 search results - page 18 / 823 » Efficient Algorithms for the Spoonerism Problem |
120
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
114
click to vote
JMLR
2010
14 years 8 months ago
2010
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a...
97
Voted
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
DNA
2004
Springer
15 years 7 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
110
click to vote
CF
2006
ACM
15 years 7 months ago
2006
ACM
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...