388 search results - page 10 / 78 » Improving Exact Algorithms for MAX-2-SAT |
BIBM
2009
IEEE
14 years 5 days ago
2009
IEEE
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
SAT
2005
Springer
14 years 2 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
SPIRE
2001
Springer
14 years 1 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
EURODAC
1994
IEEE
14 years 29 days ago
1994
IEEE
Clock routing has become a critical issue in the layout design of high-performance systems. We show that the two passes bottom-up and top-down of the DME algorithm 2, 3, 4, 8 can ...