Sciweavers

272 search results - page 52 / 55
» Modeling Conversational Dynamics as a Mixed-Memory Markov Pr...
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
15 years 4 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
GLOBECOM
2007
IEEE
15 years 4 months ago
Constrained Stochastic Games in Wireless Networks
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
EENERGY
2010
15 years 1 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
DAS
2006
Springer
15 years 1 months ago
Aligning Transcripts to Automatically Segmented Handwritten Manuscripts
Abstract. Training and evaluation of techniques for handwriting recognition and retrieval is a challenge given that it is difficult to create large ground-truthed datasets. This is...
Jamie L. Rothfeder, R. Manmatha, Toni M. Rath