Sciweavers

1016 search results - page 137 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
14 years 11 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
DAGSTUHL
2006
14 years 11 months ago
Pre-Routed FPGA Cores for Rapid System Construction in a Dynamic Reconfigurable System
This paper presents a method of constructing pre-routed FPGA cores which lays the foundations for a rapid system construction framework for dynamically reconfigurable computing sy...
Douglas L. Maskell, Timothy F. Oliver
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 1 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
CN
2002
98views more  CN 2002»
14 years 9 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
ICC
2008
IEEE
139views Communications» more  ICC 2008»
15 years 4 months ago
Practical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas
Abstract— Wireless Mesh Network (WMN) has been recognized as one of the promising technologies to provide wireless broadband access. In addition to the multi-radio multi-channel ...
Wei Zhou, Xi Chen, Daji Qiao