1689 search results - page 116 / 338 » Proximate point searching |
135
click to vote
EPEW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Distributed security models based on a ‘web of trust’ eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches r...
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
101
Voted
IPTPS
2004
Springer
15 years 6 months ago
2004
Springer
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. Whil...
85
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
111
click to vote
DL
2000
Springer
15 years 5 months ago
2000
Springer
Digital library search results are usually shown as a textual list, with 10-20 items per page. Viewing several thousand search results at once on a two-dimensional display with co...