Sciweavers

269 search results - page 16 / 54
» The Quantitative Structure of Exponential Time
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 4 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
CP
2007
Springer
14 years 1 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
PPL
2008
75views more  PPL 2008»
13 years 7 months ago
Modeling the Performance of Communication Schemes on Network Topologies
This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme...
Jan Lemeire, Erik F. Dirkx, Walter Colitti
BMCBI
2006
82views more  BMCBI 2006»
13 years 7 months ago
Selection of antisense oligonucleotides based on multiple predicted target mRNA structures
Background: Local structures of target mRNAs play a significant role in determining the efficacies of antisense oligonucleotides (ODNs), but some structure-based target site selec...
Xiaochen Bo, Shaoke Lou, Daochun Sun, Wenjie Shu, ...