460 search results - page 65 / 92 » Bounding the locality of distributed routing algorithms |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
SPAA
1999
ACM
14 years 1 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ICPP
2007
IEEE
14 years 3 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
COLCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose a new overlay network, called Generic Identifier Network (GIN), for collaborative nodes to share objects with transactions across affiliated organizations by merging th...
DCOSS
2005
Springer
14 years 2 months ago
2005
Springer
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...