Sciweavers

683 search results - page 63 / 137
» Coarticulation in Markov Decision Processes
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ECML
2007
Springer
13 years 11 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
ICML
1995
IEEE
14 years 10 months ago
Learning Policies for Partially Observable Environments: Scaling Up
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
Michael L. Littman, Anthony R. Cassandra, Leslie P...
ICTAI
2005
IEEE
14 years 2 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
INFOCOM
2011
IEEE
13 years 15 days ago
A high-throughput routing metric for reliable multicast in multi-rate wireless mesh networks
Abstract—We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multi...
Xin Zhao, Jun Guo, Chun Tung Chou, Archan Misra, S...