Sciweavers

8094 search results - page 163 / 1619
» Improvements in Formula Generalization
Sort
View
ENTCS
2007
141views more  ENTCS 2007»
13 years 9 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere
PR
2006
120views more  PR 2006»
13 years 9 months ago
Alternative learning vector quantization
In this paper, we discuss the influence of feature vectors contributions at each learning time t on a sequential-type competitive learning algorithm. We then give a learning rate ...
Kuo-Lung Wu, Miin-Shen Yang
GIS
1998
ACM
13 years 9 months ago
Accuracy of Local Topographic Variables Derived from Digital Elevation Models
We study the accuracy of data on some local topographic attributes derived from digital elevation models (DEMs). First, we carry out a test for the precision of four methods for ca...
Igor v. Florinsky
FUIN
2010
112views more  FUIN 2010»
13 years 7 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Luca Pulina, Armando Tacchella
AAAI
2010
13 years 6 months ago
Exploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
Alexandra Goultiaeva, Fahiem Bacchus