1859 search results - page 363 / 372 » Sketch-based path design |
NSDI
2004
13 years 9 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
NSDI
2004
13 years 9 months ago
2004
This paper describes the design, implementation, and experimental evaluation of OverQoS, an overlay-based architecture for enhancing the best-effort service of today's Intern...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
EVOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This contribution studies speciation from the standpoint of evolutionary robotics (ER). A common approach to ER is to design a robot’s control system using neuro-evolut...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...