2924 search results - page 381 / 585 » Lower Bounds in Distributed Computing |
159
Voted
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
144
click to vote
ICALP
1992
Springer
15 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...
155
click to vote
CCS
2006
ACM
15 years 8 months ago
2006
ACM
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
149
click to vote
DAC
1995
ACM
15 years 8 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
130
click to vote
WG
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...