10988 search results - page 100 / 2198 » Algorithmic Folding Complexity |
128
Voted
SBACPAD
2006
IEEE
15 years 8 months ago
2006
IEEE
Neural-inspired branch predictors achieve very low branch misprediction rates. However, previously proposed implementations have a variety of characteristics that make them challe...
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
114
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
106
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
117
click to vote
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...