2976 search results - page 163 / 596 » On the bounded integer programming |
154
Voted
MST
2010
15 years 4 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
175
click to vote
JCT
2011
15 years 1 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
154
click to vote
FM
2009
Springer
15 years 11 months ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
134
Voted
PDPTA
2004
15 years 7 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
174
Voted
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...