Sciweavers

5314 search results - page 943 / 1063
» Hybrid Dynamic Programming
Sort
View
UAI
2004
13 years 11 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
AAAI
1998
13 years 11 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ACL
1998
13 years 11 months ago
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
Marilyn A. Walker, Jeanne Frommer, Shrikanth Naray...
WSCG
2003
171views more  WSCG 2003»
13 years 11 months ago
A Task Definition Language for Virtual Agents
The use of Virtual Environments as a user interface can be important for certain types of applications, especially in the fields of education and entertainment. These synthetic wo...
Spyros Vosinakis, Themis Panayiotopoulos
NIPS
2000
13 years 11 months ago
Text Classification using String Kernels
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
Huma Lodhi, John Shawe-Taylor, Nello Cristianini, ...