Sciweavers

1806 search results - page 45 / 362
» Randomness and halting probabilities
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 9 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
WSC
2001
13 years 9 months ago
Resampling methods for input modeling
Stochastic simulation models are used to predict the behavior of real systems whose components have random variation. The simulation model generates artificial random quantities b...
Russell R. Barton, Lee Schruben
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
14 years 2 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
APPROX
2010
Springer
146views Algorithms» more  APPROX 2010»
13 years 9 months ago
Delaying Satisfiability for Random 2SAT
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
Alistair Sinclair, Dan Vilenchik
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor