681 search results - page 36 / 137 » General Polynomial Time Decomposition Algorithms |
78
Voted
ISLPED
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a technique called “workload decomposition” in which the CPU workload is decomposed in two parts: on-chip and off-chip. The on-chip workload signifies the ...
123
Voted
TCS
2010
14 years 11 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
97
Voted
IPCO
2007
15 years 2 months ago
2007
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
80
Voted
ISMVL
1997
IEEE
15 years 4 months ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
106
Voted
JAIR
2008
15 years 16 days ago
2008
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...