Sciweavers

424 search results - page 43 / 85
» Boosted sampling: approximation algorithms for stochastic op...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Stochastic resource allocation for cognitive radio networks based on imperfect state information
Efficient design of cognitive radio networks calls for secondary users implementing adaptive resource allocation, which requires knowledge of the channel state information in ord...
Antonio G. Marqués, Georgios B. Giannakis, ...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 28 days ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
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
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 10 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
PE
2006
Springer
145views Optimization» more  PE 2006»
13 years 7 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter