Sciweavers

1578 search results - page 96 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ISPD
2003
ACM
103views Hardware» more  ISPD 2003»
14 years 2 months ago
An integrated floorplanning with an efficient buffer planning algorithm
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
Yuchun Ma, Xianlong Hong, Sheqin Dong, Song Chen, ...
CN
2002
98views more  CN 2002»
13 years 8 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
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 3 months ago
BGP-lens: patterns and anomalies in internet routing updates
The Border Gateway Protocol (BGP) is one of the fundamental computer communication protocols. Monitoring and mining BGP update messages can directly reveal the health and stabilit...
B. Aditya Prakash, Nicholas Valler, David Andersen...
MOBIHOC
2008
ACM
14 years 8 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
JBCB
2008
71views more  JBCB 2008»
13 years 8 months ago
Using Indirect protein-protein Interactions for protein Complex Prediction
Protein complexes are fundamental for understanding principles of cellular organizations. Accurate and fast protein complex prediction from the PPI networks of increasing sizes ca...
Hon Nian Chua, Kang Ning, Wing-Kin Sung, Hon Wai L...