2333 search results - page 276 / 467 » Recursive Computational Depth |
106
Voted
UAI
2004
15 years 3 months ago
2004
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
114
click to vote
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
123
Voted
HPCC
2010
Springer
15 years 2 months ago
2010
Springer
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
99
Voted
ENTCS
2008
15 years 2 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
118
Voted
IGPL
2006
15 years 2 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...