663 search results - page 8 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
DATE
2000
IEEE
13 years 12 months ago
2000
IEEE
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
SIAMJO
2000
13 years 7 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
ICCAD
2000
IEEE
13 years 12 months ago
2000
IEEE
—As the complexity of digital filters is dominated by the number of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the co...
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
TKDE
2012
11 years 10 months ago
2012
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...