5849 search results - page 230 / 1170 » Predictive search distributions |
164
click to vote
ESA
2003
Springer
16 years 12 days ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
172
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
172
click to vote
ACNS
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...
208
click to vote
FTDCS
2004
IEEE
15 years 11 months ago
2004
IEEE
A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay ...
247
click to vote
SASO
2007
IEEE
16 years 1 months ago
2007
IEEE
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...