3221 search results - page 160 / 645 » Termination of Linear Programs |
170
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
175
click to vote
CSFW
1997
IEEE
15 years 10 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
156
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
189
click to vote
JAR
2008
15 years 6 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
150
click to vote
SCP
1998
15 years 6 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...