681 search results - page 58 / 137 » General Polynomial Time Decomposition Algorithms |
95
Voted
JSC
2007
15 years 11 days 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 ...
86
Voted
TCS
2010
14 years 11 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...
112
click to vote
GLVLSI
2010
IEEE
15 years 20 days 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...
GECCO
2007
Springer
15 years 6 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...
85
Voted
JDA
2007
15 years 11 days 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...