268 search results - page 30 / 54 » Solving multiagent assignment Markov decision processes |
157
Voted
ECML
2007
Springer
15 years 5 months ago
2007
Springer
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...
155
click to vote
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
136
Voted
IUI
2010
ACM
16 years 6 days ago
2010
ACM
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
155
click to vote
PRICAI
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
147
click to vote
AIPS
2008
15 years 5 months ago
2008
This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...