Sciweavers

3678 search results - page 509 / 736
» On the Stable Paths Problem
Sort
View
148
Voted
ISPD
1997
ACM
110views Hardware» more  ISPD 1997»
15 years 8 months ago
Performance driven global routing for standard cell design
Advances in fabrication technology have resulted in a continual shrinkage of device dimensions. This has resulted in smaller device delays, greater resistance along interconnect w...
Jason Cong, Patrick H. Madden
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 4 months ago
Performance evaluation of a new route optimization technique for mobile IP
Mobile ip (mip) is an internet protocol that allows mobile nodes to have continuous network connectivity to the internet without changing their ip addresses while moving to other ...
Moheb R. Girgis, Tarek M. Mahmoud, Youssef S. Takr...
CN
2006
70views more  CN 2006»
15 years 4 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
TIT
2008
83views more  TIT 2008»
15 years 4 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
141
Voted
RECOMB
2005
Springer
16 years 5 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...