Sciweavers

1631 search results - page 87 / 327
» Uniform Distributed Synthesis
Sort
View
CP
2008
Springer
14 years 1 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
CN
2010
83views more  CN 2010»
13 years 10 months ago
Secure peer sampling
PuppetCast is a protocol for secure peer sampling in large-scale distributed systems. A peer sampling protocol continuously provides each node in the system with a uniform random ...
Gian Paolo Jesi, Alberto Montresor, Maarten van St...
RSA
2008
84views more  RSA 2008»
13 years 10 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
JCT
2010
81views more  JCT 2010»
13 years 9 months ago
On the probability of a rational outcome for generalized social welfare functions on three alternatives
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
Nathan Keller
FSTTCS
2010
Springer
13 years 9 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet