Sciweavers

16091 search results - page 433 / 3219
» Solving
Sort
View
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
15 years 10 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 10 months ago
A Duality between Clause Width and Clause Density for SAT
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
COCOON
2006
Springer
15 years 10 months ago
Reconciling Gene Trees with Apparent Polytomies
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
Wen-Chieh Chang 0002, Oliver Eulenstein
COCOON
2006
Springer
15 years 10 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
192
Voted
CONCUR
2006
Springer
15 years 10 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger