2157 search results - page 80 / 432 » Optimal Fast Hashing |
158
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
135
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
132
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Traditional particle swarm optimization (PSO) suffers from the premature convergence problem, which usually results in PSO being trapped in local optima. This paper presents an...
115
click to vote
ISCA
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
139
click to vote
PLDI
1996
ACM
15 years 8 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...