79 search results - page 9 / 16 » A Dynamic Programming Framework for Combinatorial Optimizati... |
JAIR
2010
13 years 6 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
IPCO
2010
13 years 9 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...