1449 search results - page 38 / 290 » Self-Randomized Exponentiation Algorithms |
95
Voted
AE
1997
Springer
15 years 6 months ago
1997
Springer
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...
177
click to vote
ISTCS
1997
Springer
15 years 6 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
138
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
112
click to vote
NIPS
2008
15 years 4 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
105
click to vote
NIPS
2007
15 years 4 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...