827 search results - page 18 / 166 » The Complexity of Probabilistic Lobbying |
COCO
1998
Springer
15 years 6 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
124
Voted
KR
2004
Springer
15 years 7 months ago
2004
Springer
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
119
click to vote
COCO
2007
Springer
15 years 5 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
113
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...