Sciweavers

499 search results - page 42 / 100
» Model Minimization in Markov Decision Processes
Sort
View
PE
2011
Springer
214views Optimization» more  PE 2011»
13 years 3 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
ATAL
2010
Springer
13 years 9 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
14 years 23 days ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci
AAAI
2011
12 years 8 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
GLOBECOM
2006
IEEE
14 years 2 months ago
Multi-Stage Investment Decision under Contingent Demand for Networking Planning
Telecommunication companies, such as Internet and cellular service providers, are seeing rapid and uncertain growth of traffic routed through their networks. It has become a chall...
Miguel F. Anjos, Michael Desroches, Anwar Haque, O...