Sciweavers

227 search results - page 12 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 5 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
BROADNETS
2006
IEEE
15 years 5 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
TROB
2010
103views more  TROB 2010»
14 years 5 months ago
Time Parameterization of Humanoid-Robot Paths
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
Wael Suleiman, Fumio Kanehiro, Eiichi Yoshida, Jea...
INFOCOM
2010
IEEE
14 years 9 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
EOR
2008
83views more  EOR 2008»
14 years 11 months ago
Rerouting tunnels for MPLS network resource optimization
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
Olivier Klopfenstein