1026 search results - page 145 / 206 » On Finding Minimal w-cutset |
AAAI
2000
13 years 10 months ago
2000
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization t...
UAI
2000
13 years 10 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
WSC
1997
13 years 10 months ago
1997
Simulation optimization can be defined as the process of finding the best input variable values from among all possibilities without explicitly evaluating each possibility. The ob...
UAI
1994
13 years 10 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
AAAI
1992
13 years 10 months ago
1992
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...