49 search results - page 5 / 10 » Approximate Counting by Sampling the Backtrack-free Search S... |
FLAIRS
2003
13 years 8 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
IMC
2009
ACM
14 years 2 months ago
2009
ACM
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
ALGORITHMICA
2008
13 years 7 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
ILP
2004
Springer
14 years 25 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...