530 search results - page 22 / 106 » Bounds on marginal probability distributions |
STOC
1997
ACM
14 years 2 days ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...