30 search results - page 2 / 6 » A 0 1 Integer Programming Model for the Office Space Allocat... |
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...