1578 search results - page 12 / 316 » Algorithmic randomness of continuous functions |
ICRA
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
JC
2007
13 years 10 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
OL
2011
13 years 5 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
We present a simple randomized construction of size O
DC
2010
13 years 11 months ago
2010
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...