Sciweavers

92 search results - page 10 / 19
» Exploiting structure in quantified formulas
Sort
View
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...
UAI
1996
13 years 8 months ago
Learning Bayesian Networks with Local Structure
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
Nir Friedman, Moisés Goldszmidt
WIA
2000
Springer
13 years 11 months ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
VALUETOOLS
2006
ACM
162views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Fast solvers for queueing systems with negative customers
In this paper, we are interested in solving Markovian queueing systems having Poisson batch arrivals, exponential servers and negative customers. Preconditioned conjugate gradient...
You-Wei Wen, Wai-Ki Ching, Michael K. Ng
SAT
2010
Springer
136views Hardware» more  SAT 2010»
13 years 11 months ago
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
William Klieber, Samir Sapra, Sicun Gao, Edmund M....