Sciweavers

447 search results - page 33 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
BIBE
2007
IEEE
115views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Semiparametric RMA Background-Correction for Oligonucleotide Arrays
—Microarray technology has provided an opportunity to simultaneously monitor the expression levels of a large number of genes in response to intentional perturbations. A necessar...
Ionut Bebu, Françoise Seillier-Moiseiwitsch...
ICML
2005
IEEE
14 years 8 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
ER
2008
Springer
110views Database» more  ER 2008»
13 years 9 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
LICS
2006
IEEE
14 years 1 months ago
Fixed-Parameter Hierarchies inside PSPACE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
Guoqiang Pan, Moshe Y. Vardi