Sciweavers

763 search results - page 77 / 153
» Engineering Shortest Path Algorithms
Sort
View
EUROPAR
2007
Springer
14 years 4 months ago
New Approaches for Relay Selection in IEEE 802.16 Mobile Multi-hop Relay Networks
The IEEE 802.16 mobile multi-hop relay (MMR) task group ā€™jā€™ (TGj) has recently introduced the multi-hop relaying concept in the IEEE 802.16 WirelessMAN, wherein a newly introdu...
Deepesh Man Shrestha, Sung-Hee Lee, Sung-Chan Kim,...
FSTTCS
2008
Springer
13 years 11 months ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M āŠ† Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar
CN
2002
77views more  CN 2002»
13 years 10 months ago
MATE: multipath adaptive traffic engineering
Destination-based forwarding in traditional IP routers has not been able to take full advantage of multiple paths that frequently exist in Internet Service Provider Networks. As a...
Anwar Elwalid, Cheng Jin, Steven H. Low, Indra Wid...
POPL
2007
ACM
14 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
JCO
2006
126views more  JCO 2006»
13 years 10 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li