Sciweavers

231 search results - page 21 / 47
» On overlays and minimization diagrams
Sort
View
94
Voted
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
14 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
DSOM
2009
Springer
15 years 4 months ago
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
Rendering networks and distributed systems self-managing and self-optimizing has become a major research focus. This task is especially important for systems, such as publish/subsc...
Arnd Schröter, Daniel Graff, Gero Mühl, ...
72
Voted
IPPS
2006
IEEE
15 years 3 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
WOA
2010
14 years 7 months ago
A Self-Organising System for Resource Finding in Large-Scale Computational Grids
This paper presents a novel approach for resource finding and job allocation in a computational Grid. The proposed system is called HYGRA, for HYperspace-based Grid Resource Alloca...
Fabrizio Messina, Giuseppe Pappalardo, Corrado San...
ICPP
2007
IEEE
15 years 3 months ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra