Sciweavers

334 search results - page 53 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
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...
ICMCS
2005
IEEE
119views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Evaluation of the Interleaved Source Coding (ISC) Under Packet Correlation
Network impairments such as delay and packet losses have severe impact on the presentation quality of many predictive video sources. Prior researches (e.g., [1]-[3][5]-[9][11]-[13...
Jin Young Lee, Hayder Radha
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...
AAAI
2007
14 years 12 months ago
Authorial Idioms for Target Distributions in TTD-MDPs
In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there i...
David L. Roberts, Sooraj Bhat, Kenneth St. Clair, ...
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
14 years 9 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins