827 search results - page 20 / 166 » The Complexity of Probabilistic Lobbying |
113
click to vote
AAAI
2008
15 years 4 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 ...
106
Voted
UAI
2008
15 years 3 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
15 years 5 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...
100
click to vote
ENTCS
2008
15 years 1 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...
103
Voted
IJAR
2007
15 years 1 months ago
2007
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...