1092 search results - page 117 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
212
click to vote
SASO
2010
IEEE
15 years 4 months ago
2010
IEEE
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
159
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
204
click to vote
COCO
2009
Springer
16 years 21 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
187
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...