Sciweavers

5138 search results - page 93 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CORR
2012
Springer
235views Education» more  CORR 2012»
13 years 9 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
AAAI
2011
14 years 1 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
APPROX
2007
Springer
88views Algorithms» more  APPROX 2007»
15 years 8 months ago
Derandomization of Euclidean Random Walks
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
Ilia Binder, Mark Braverman
153
Voted
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 3 months ago
Reducing the Cost of Generating APH-Distributed Random Numbers
Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in sim...
Philipp Reinecke, Miklós Telek, Katinka Wol...
121
Voted
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 5 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga