Sciweavers

1080 search results - page 148 / 216
» Distributed Hash Tables
Sort
View
SYMMETRY
2010
90views more  SYMMETRY 2010»
15 years 22 days ago
Orientational Sampling Schemes Based on Four Dimensional Polytopes
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
Salvatore Mamone, Giuseppe Pileio, Malcolm H. Levi...
SPAA
2005
ACM
15 years 11 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
PPSN
1998
Springer
15 years 10 months ago
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of commu...
Gianni Di Caro, Marco Dorigo
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 7 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
ICFP
2009
ACM
16 years 6 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...