Sciweavers

260 search results - page 47 / 52
» Quasi-Deterministic Partially Observable Markov Decision Pro...
Sort
View
ICN
2007
Springer
14 years 2 months ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
ICASSP
2011
IEEE
13 years 15 days ago
POMDP concept policies and task structures for hybrid dialog management
We address several challenges for applying statistical dialog managers based on Partially Observable Markov Models to real world problems: to deal with large numbers of concepts, ...
Sebastian Varges, Giuseppe Riccardi, Silvia Quarte...
ICML
2007
IEEE
14 years 9 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
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
HRI
2007
ACM
14 years 19 days ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy