2926 search results - page 4 / 586 » Partially Optimal Routing |
HICSS
2003
IEEE
15 years 2 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...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems ha...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...