8689 search results - page 195 / 1738 » Software: hard data |
281
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
169
click to vote
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
152
click to vote
AC
2003
Springer
15 years 11 months ago
2003
Springer
Peer-to-peer systems are positioned to take advantage of gains in network bandwidth, storage capacity, and computational resources to provide long-term durable storage infrastruct...
144
click to vote
LCPC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. As the speed gap between CPU and memory widens, memory hierarchy has become the performance bottleneck for most applications because of both the high latency and low band...
306
click to vote
AC
2011
Springer
15 years 1 months ago
2011
Springer
Traditionally, the development of computing systems has been focused on performance improvements driven by the demand of applications from consumer, scientific, and business domai...