1300 search results - page 166 / 260 » Probabilistic logic with independence |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
MMAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. When agents coordinate according to the principles of teamwork they can flexibly, robustly and reliably achieve complex goals in complex, dynamic and even hostile enviro...
COLT
1992
Springer
13 years 12 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
TCOM
2010
13 years 6 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...