Sciweavers

499 search results - page 85 / 100
» Model Minimization in Markov Decision Processes
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
NC node selection game in collaborative streaming systems
Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distribute...
Nikolaos Thomos, Hyunggon Park, Eymen Kurdoglu, Pa...
ICML
2009
IEEE
14 years 9 months ago
Predictive representations for policy gradient in POMDPs
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
Abdeslam Boularias, Brahim Chaib-draa
ICML
2007
IEEE
14 years 9 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
MOBIHOC
2008
ACM
14 years 8 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
INFOCOM
2009
IEEE
14 years 3 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...