1258 search results - page 34 / 252 » Architecture-driven Problem Decomposition |
152
click to vote
IANDC
2006
15 years 5 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
161
click to vote
TIP
2008
15 years 5 months ago
2008
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
181
click to vote
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
155
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
153
click to vote
DAC
1999
ACM
16 years 6 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...