681 search results - page 72 / 137 » General Polynomial Time Decomposition Algorithms |
88
Voted
MP
1998
15 years 3 days ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
136
click to vote
DAC
2004
ACM
16 years 1 months ago
2004
ACM
This paper describes a dynamic voltage and frequency scaling (DVFS) technique for MPEG decoding to reduce the energy consumption using the computational workload decomposition. Th...
126
click to vote
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
110
click to vote
LCTRTS
2009
Springer
15 years 7 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...