16404 search results - page 203 / 3281 » A set coverage problem |
123
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
133
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
114
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
121
Voted
ISCAPDCS
2003
15 years 5 months ago
2003
We consider efficient strategies for the parallel and distributed computation of large sets of multivariate integrals. These arise in many applications such as computational chem...
126
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...