2899 search results - page 117 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
132
click to vote
MICRO
2007
IEEE
15 years 7 months ago
2007
IEEE
Program runtime characteristics exhibit significant variation. As microprocessor architectures become more complex, their efficiency depends on the capability of adapting with wor...
112
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
110
click to vote
TEC
2010
14 years 8 months ago
2010
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
113
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...