Sciweavers

3433 search results - page 220 / 687
» Heuristics for a bidding problem
Sort
View
AIPS
2006
15 years 8 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
AAAI
2000
15 years 8 months ago
Sampling Methods for Action Selection in Influence Diagrams
Sampling has become an important strategy for inference in belief networks. It can also be applied to the problem of selecting actions in influence diagrams. In this paper, we pre...
Luis E. Ortiz, Leslie Pack Kaelbling
AAAI
1992
15 years 7 months ago
Learning to Disambiguate Relative Pronouns
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...
Claire Cardie
IJCBDD
2008
113views more  IJCBDD 2008»
15 years 6 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
ET
2006
55views more  ET 2006»
15 years 6 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty