827 search results - page 66 / 166 » The Complexity of Probabilistic Lobbying |
181
Voted
NIPS
2003
15 years 8 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
147
click to vote
UAI
1997
15 years 8 months ago
1997
We review the problem of time-critical action and discuss a reformulation that shifts knowledge acquisition from the assessment of complex temporal probabilistic dependencies to t...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
162
click to vote
JAIR
2007
15 years 6 months ago
2007
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
192
Voted
COCO
2005
Springer
16 years 9 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...