15033 search results - page 132 / 3007 » Complexity Theory and Algorithms |
146
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
137
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
134
click to vote
CSCLP
2005
Springer
15 years 9 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
128
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
154
click to vote
AICT
2005
IEEE
15 years 9 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...