3221 search results - page 182 / 645 » Termination of Linear Programs |
148
click to vote
AAAI
2006
15 years 7 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
199
click to vote
TIT
2010
15 years 1 months ago
2010
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
163
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
145
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
144
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...