2252 search results - page 110 / 451 » Lower Bounds for Dynamic Algorithms |
91
Voted
AAECC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
135
click to vote
JMLR
2010
14 years 10 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
134
click to vote
MASCOTS
2007
15 years 4 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
145
click to vote
UAI
2008
15 years 4 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
124
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...