Sciweavers

402 search results - page 40 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Reinforcement learning for DEC-MDPs with changing action sets and partially ordered dependencies
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
Thomas Gabel, Martin A. Riedmiller
ACL
2010
13 years 6 months ago
Towards Relational POMDPs for Adaptive Dialogue Management
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
Pierre Lison
EDBT
2006
ACM
137views Database» more  EDBT 2006»
14 years 8 months ago
Data Mapping as Search
In this paper, we describe and situate the TUPELO system for data mapping in relational databases. Automating the discovery of mappings between structured data sources is a long st...
George H. L. Fletcher, Catharine M. Wyss
ICIP
2003
IEEE
14 years 10 months ago
Multitemporal geospatial query grouping using correlation signatures
With recent advances in temporal and spatiotemporal databases, user demands are becoming more complex. As a result, simple queries are replaced by complex multitemporal query scen...
Giorgos Mountrakis, Peggy Agouris, Anthony Stefani...
JAIR
2008
107views more  JAIR 2008»
13 years 8 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld