Sciweavers

39 search results - page 1 / 8
» Sampling Combinatorial Spaces Using Biased Random Walks
Sort
View
IJCAI
2003
13 years 5 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Jordan Erenrich, Bart Selman
AAAI
2004
13 years 5 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
ICDCS
2007
IEEE
13 years 10 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
13 years 9 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
WWW
2006
ACM
14 years 4 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich