356 search results - page 7 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
CP
2009
Springer
14 years 9 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
VLSID
2003
IEEE
14 years 9 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...