2976 search results - page 187 / 596 » On the bounded integer programming |
191
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
294
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
191
click to vote
EACL
2009
ACL Anthology
15 years 4 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
325
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
218
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...