81 search results - page 6 / 17 » Decision Theoretic Dialogue Planning for Initiative Problems |
ML
2002
ACM
14 years 9 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
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...
71
Voted
AIPS
2003
14 years 11 months ago
2003
Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a pr...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...