4110 search results - page 9 / 822 » Efficient algorithms for the 2-gathering problem |
EVOW
2006
Springer
15 years 3 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
ESANN
2003
15 years 1 months ago
2003
Efficient probability density function estimation is of primary interest in statistics. A popular approach for achieving this is the use of finite Gaussian mixture models. Based on...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
DISOPT
2008
14 years 11 months ago
2008
An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for...
100
click to vote
EUROCRYPT
2000
Springer
15 years 3 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...