Sciweavers

2095 search results - page 269 / 419
» Improved pebbling bounds
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Rate adaptation via link-layer feedback for goodput maximization over a time-varying channel
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
Rohit Aggarwal, Phil Schniter, Can Emre Koksal
GLOBECOM
2007
IEEE
16 years 1 months ago
A Technique to Enhance Localization in the Presence of NLOS Errors
— In a wireless network (WN), the wireless devices generally localize themselves with the help of anchors that are pre-deployed in the network. Some of the techniques commonly us...
Satyajayant Misra, Weiyi Zhang, Guoliang Xue
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
LCTRTS
2007
Springer
16 years 1 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...
OOPSLA
2007
Springer
16 years 1 months ago
Using early phase termination to eliminate load imbalances at barrier synchronization points
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
Martin C. Rinard