CDC
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper considers the synthesis of infinity norm Lyapunov functions for discrete-time linear systems. A proper conic partition of the state-space is employed to construct a fini...
QEST
2010
IEEE
13 years 10 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
CONSTRAINTS
1999
14 years 6 days ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
COMBINATORICS
2007
14 years 16 days ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
ICALP
2001
Springer
14 years 5 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
ATVA
2009
Springer
14 years 7 months ago
2009
Springer
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
VMCAI
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
CAV
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...