129 search results - page 11 / 26 » Abstractive Meeting Summarization as a Markov Decision Proce... |
AROBOTS
2008
14 years 8 months ago
2008
Abstract Many elderly and physically impaired people experience difficulties when maneuvering a powered wheelchair. In order to provide improved maneuvering, powered wheelchairs ha...
ALT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
AIPS
1998
14 years 11 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...