Sciweavers

410 search results - page 51 / 82
» Upgrading Shortest Paths in Networks
Sort
View
AAAI
2000
15 years 2 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
ISCI
2007
134views more  ISCI 2007»
15 years 1 months ago
A location-aware multicasting protocol for Bluetooth Location Networks
Bluetooth Location Network (BLN) is a Bluetooth radio network that is composed of some mobile Bluetooth devices and static Bluetooth units, and is established at the system initia...
Chih-Yung Chang, Kuei-Ping Shih, Chung-Hsien Hsu, ...
JCC
2011
105views more  JCC 2011»
14 years 8 months ago
Wordom: A user-friendly program for the analysis of molecular structures, trajectories, and free energy surfaces
Abstract: Wordom is a versatile, user-friendly, and efficient program for manipulation and analysis of molecular structures and dynamics. The following new analysis modules have b...
Michele Seeber, Angelo Felline, Francesco Raimondi...
INFOCOM
1998
IEEE
15 years 5 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
TWC
2011
291views more  TWC 2011»
14 years 8 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...