99 search results - page 5 / 20 » Quantifier structure in search based procedures for QBFs |
108
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
EACL
1993
ACL Anthology
14 years 11 months ago
1993
ACL Anthology
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
EOR
2007
14 years 10 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
UAI
2003
14 years 11 months ago
2003
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
NIPS
2000
14 years 11 months ago
2000
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...