2976 search results - page 89 / 596 » On the bounded integer programming |
117
click to vote
IPL
2011
14 years 7 months ago
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
118
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
96
Voted
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
89
Voted
FM
2008
Springer
15 years 2 months ago
2008
Springer
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
136
Voted
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...