429 search results - page 42 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
SWAT
2010
Springer
14 years 7 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
CCR
2006
14 years 10 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
WCE
2007
14 years 11 months ago
2007
— This paper proposes an age artificial immune system (AAIS), for optimal order pickings in an Automated Storage and Retrieval System (AS/RS) with multiple input/ output stations...
PLDI
1995
ACM
15 years 1 months ago
1995
ACM
DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, ge...