1391 search results - page 124 / 279 » Distributed routing in networks using affinity propagation |
189
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
125
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
161
click to vote
ICCCN
2008
IEEE
16 years 26 days ago
2008
IEEE
— Internet service providers have to provision network resources to optimize bandwidth utilization. Dynamic routing protocols take traffic variations into account to control the...
162
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
141
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...