427 search results - page 34 / 86 » A Subexponential Bound for Linear Programming |
110
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
132
click to vote
ICTAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
133
Voted
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
113
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
126
Voted
UAI
2008
15 years 4 months ago
2008
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...