2976 search results - page 11 / 596 » On the bounded integer programming |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
IPL
2008
13 years 7 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
CC
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...