Sciweavers

2796 search results - page 32 / 560
» The coolest path problem
Sort
View
IEICET
2010
124views more  IEICET 2010»
14 years 9 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 6 months ago
Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, M...
INFOCOM
2010
IEEE
14 years 10 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
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 4 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 6 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq