Sciweavers

427 search results - page 12 / 86
» A Subexponential Bound for Linear Programming
Sort
View
IJCAI
2007
13 years 9 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
CP
2007
Springer
14 years 1 months ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont
STACS
2009
Springer
14 years 2 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
14 years 11 days ago
Bilevel programming for analysis of low-complexity control of linear systems with constraints
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
Henrik Manum, Colin Neil Jones, Johan Löfberg...
TAMC
2009
Springer
14 years 2 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen