Sciweavers

1017 search results - page 76 / 204
» A routing algorithm for flip-chip design
Sort
View
EDBT
2010
ACM
143views Database» more  EDBT 2010»
15 years 4 months ago
Efficient and scalable multi-geography route planning
This paper considers the problem of Multi-Geography Route Planning (MGRP) where the geographical information may be spread over multiple heterogeneous interconnected maps. We firs...
Vidhya Balasubramanian, Dmitri V. Kalashnikov, Sha...
ANTSW
2008
Springer
15 years 3 months ago
A Simulation Study of Routing Performance in Realistic Urban Scenarios for MANETs
Abstract. We study through simulation the performance of two MANET routing algorithms in a realistic urban environment. The two algorithms, AODV and AntHocNet, are representative o...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
ADHOCNOW
2008
Springer
15 years 7 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
DAC
1995
ACM
15 years 5 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
ICDCS
2006
IEEE
15 years 7 months ago
Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks
This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control o...
Mingqiang Xue, Inn Inn Er, Winston Khoon Guan Seah