610 search results - page 79 / 122 » Using SAT in QBF |
AAAI
2004
13 years 10 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
PRICAI
2010
Springer
13 years 7 months ago
2010
Springer
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
AAAI
2010
13 years 7 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
JAIR
2011
13 years 4 months ago
2011
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
INTERSPEECH
2010
13 years 3 months ago
2010
In the paper we present two techniques improving the recognition accuracy of multilayer perceptron neural networks (MLP ANN) by means of adopting Speaker Adaptive Training. The us...