Sciweavers

2926 search results - page 62 / 586
» Partially Optimal Routing
Sort
View
WIOPT
2011
IEEE
14 years 4 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
ECML
2005
Springer
15 years 6 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
125
Voted
PE
2011
Springer
266views Optimization» more  PE 2011»
14 years 7 months ago
Lumping partially symmetrical stochastic models
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...
USITS
2001
15 years 2 months ago
Partial Prefetch for Faster Surfing in Composite Hypermedia
In this paper we present a prefetch technique, which incorporates a scheme similar to data streaming to minimize the response-lag. Unlike previous all or none techniques, we propo...
Javed I. Khan, Qingping Tao
94
Voted
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
15 years 25 days ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....