Sciweavers

373 search results - page 68 / 75
» On Deterministic Approximation of DNF
Sort
View
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 5 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
AI
2011
Springer
13 years 2 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
CMSB
2007
Springer
14 years 1 months ago
A Unifying Framework for Modelling and Analysing Biochemical Pathways Using Petri Nets
We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each per...
David Gilbert, Monika Heiner, Sebastian Lehrack