2976 search results - page 140 / 596 » On the bounded integer programming |
131
Voted
PADO
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
116
click to vote
WCET
2008
15 years 4 months ago
2008
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
170
click to vote
AMAI
1999
Springer
15 years 2 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
113
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper is concerned with the problem of receding horizon control of discrete-time systems subject to possibly unbounded random noise inputs, while satisfying hard bounds on the...