993 search results - page 21 / 199 » The Complexity of Probabilistic EL |
CPC
1998
13 years 7 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
AAAI
2008
13 years 10 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
UAI
2008
13 years 9 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
WDAG
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
ENTCS
2008
13 years 7 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...