Sciweavers

552 search results - page 52 / 111
» Constrained Shortest Path Computation
Sort
View
CCECE
2006
IEEE
15 years 3 months ago
Integrated Routing System for Wireless Mesh Networks
Recently Wireless Mesh Network (WMN) has become popular especially for its low cost deployment in the areas of poor network infrastructure and terrain of difficult deployment. Alt...
Muhammad Jaseemuddin, Amir Esmailpour, Ali Alwan, ...
INFOCOM
2010
IEEE
14 years 8 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
CVPR
2005
IEEE
15 years 11 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
COMCOM
2006
75views more  COMCOM 2006»
14 years 9 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
EUROPAR
2009
Springer
15 years 4 months ago
A Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
Andre Osterloh