1806 search results - page 34 / 362 » Randomness and halting probabilities |
JCAM
2010
13 years 2 months ago
2010
We consider the random walk on Z+ = {0, 1, ...} , with up and down transition probabilities given the chain is in state x {1, 2, ...}: (1) px = 1 2 ,, 1 2x +
IJCAI
2007
13 years 9 months ago
2007
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
IJAR
2008
13 years 7 months ago
2008
There exist many tools for capturing imprecision in probabilistic representations. Among them are random sets, possibility distributions, probability intervals, and the more recen...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.