Sciweavers

2626 search results - page 197 / 526
» The complexity of stochastic sequences
Sort
View
COLT
2010
Springer
15 years 4 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
COMPLEX
2009
Springer
15 years 10 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
ICC
2009
IEEE
121views Communications» more  ICC 2009»
15 years 4 months ago
Three Layered Hidden Markov Models for Binary Digital Wireless Channels
Abstract--Generative models are created to be used in the design and performance assessment of high layer wireless communication protocols and some error control strategies. Genera...
Omar S. Salih, Cheng-Xiang Wang, David I. Laurenso...
TCSV
2010
15 years 1 months ago
Action Detection in Cluttered Video With Successive Convex Matching
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...
Hao Jiang, Mark S. Drew, Ze-Nian Li