Sciweavers

766 search results - page 93 / 154
» Network tomography on general topologies
Sort
View
COCOON
2008
Springer
15 years 1 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
AINA
2007
IEEE
15 years 6 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 6 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
MOBICOM
2005
ACM
15 years 5 months ago
Assignment of dynamic transmission range based on estimation of vehicle density
Vehicular Ad Hoc Networks (VANET) have several characteristics that distinguish them from other ad hoc networks. Among those is the rapid change in topology due to traffic jams, w...
Maen M. Artimy, William Robertson, William J. Phil...
MIDDLEWARE
2004
Springer
15 years 5 months ago
Designing a context-aware middleware for asynchronous communication in mobile ad hoc environments
In mobile ad hoc networks, synchronous communication mechanisms appear to be not suitable, since these assume that the involved entities are present at the same time during the in...
Mirco Musolesi