1258 search results - page 31 / 252 » Architecture-driven Problem Decomposition |
ISVC
2007
Springer
14 years 2 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
SIAMNUM
2010
13 years 3 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
TASLP
2010
13 years 3 months ago
2010
Spherical harmonic decomposition of wavefields is not only an active problem in acoustic signal processing but also a useful tool in a plethora of applications such as 3D beamform...
DISOPT
2006
13 years 8 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...