366 search results - page 4 / 74 » Dynamic Programming for Graphs on Surfaces |
DISOPT
2006
13 years 6 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"...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
PAMI
2011
13 years 1 months ago
2011
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
TAICPART
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...