Sciweavers

5314 search results - page 199 / 1063
» Hybrid Dynamic Programming
Sort
View
161
Voted
JMLR
2012
13 years 5 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
PPAM
2007
Springer
15 years 8 months ago
A Container-Iterator Parallel Programming Model
There are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain speci...
Gerhard W. Zumbusch
153
Voted
WCRE
2000
IEEE
15 years 7 months ago
A Structured Demonstration of Program Comprehension Tools
This paper describes a structured tool demonstration, a hybrid evaluation technique that combines elements from experiments, case studies, and technology demonstrations. Developer...
Susan Elliott Sim, Margaret-Anne D. Storey
102
Voted
ISVC
2007
Springer
15 years 8 months ago
Combinatorial Shape Decomposition
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
Ralf Juengling, Melanie Mitchell
96
Voted
EDCC
2005
Springer
15 years 8 months ago
Adding Fault-Tolerance Using Pre-synthesized Components
We present a hybrid synthesis method for automatic addition of fault-tolerance to distributed programs. In particular, we automatically specify and add pre-synthesized fault-tolera...
Sandeep S. Kulkarni, Ali Ebnenasir