681 search results - page 58 / 137 » General Polynomial Time Decomposition Algorithms |
116
click to vote
JSC
2007
15 years 3 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
113
click to vote
TCS
2010
15 years 1 months ago
2010
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
134
click to vote
GLVLSI
2010
IEEE
15 years 3 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
123
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
119
click to vote
JDA
2007
15 years 3 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...