Sciweavers

3678 search results - page 550 / 736
» On the Stable Paths Problem
Sort
View
ICNP
2005
IEEE
15 years 9 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
INFOCOM
2005
IEEE
15 years 9 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
15 years 9 months ago
Register binding and port assignment for multiplexer optimization
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
Deming Chen, Jason Cong
COMPGEOM
2004
ACM
15 years 9 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
IPPS
2003
IEEE
15 years 9 months ago
Performance Analysis of Distributed Search in Open Agent Systems
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura