1723 search results - page 35 / 345 » Cycling in linear programming problems |
136
click to vote
JMLR
2010
15 years 28 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
115
click to vote
NIPS
2003
15 years 3 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
119
click to vote
ENDM
2010
14 years 12 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
105
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...