3208 search results - page 431 / 642 » A Lower Bound for Primality |
198
Voted
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
173
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
198
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
172
click to vote
FSE
2004
Springer
16 years 6 hour ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
163
click to vote
GD
2004
Springer
16 years 5 hour ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...