2976 search results - page 176 / 596 » On the bounded integer programming |
125
Voted
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
168
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
158
click to vote
LCTRTS
1998
Springer
15 years 10 months ago
1998
Springer
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
173
click to vote
ACSD
2008
IEEE
16 years 27 days ago
2008
IEEE
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
176
Voted
CPAIOR
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...