Sciweavers

6102 search results - page 805 / 1221
» Generating Optimizing Specializers
Sort
View
UAI
2004
15 years 8 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
UAI
2003
15 years 8 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
NIPS
1998
15 years 8 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
WSC
1997
15 years 8 months ago
Simulation-based Planning for Multi-Agent Environments
One of the key issues in reasoning with multiple interacting intelligent agents is how to model and code the decision making process of the agents. In Artificial Intelligence (AI...
Jin Joo Lee, Paul A. Fishwick
NAACL
1994
15 years 8 months ago
Recent Improvements in the CMU Spoken Language Understanding System
We have been developing a spoken language system to recognize and understand spontaneous speech. It is difficult for such systems to achieve good coverage of the lexicon and gramm...
Wayne Ward, Sunil Issar