Sciweavers

53 search results - page 10 / 11
» Metric Embeddings with Relaxed Guarantees
Sort
View
INFOCOM
2011
IEEE
12 years 8 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
RTAS
1997
IEEE
13 years 9 months ago
Exploiting Redundancy for Timeliness in TCP Boston
While ATM bandwidth-reservation techniques are able to o er the guarantees necessary for the delivery of real-time streams in many applications (e.g. live audio and video), they s...
Azer Bestavros, Gitae Kim
KIVS
2011
Springer
12 years 8 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
RTCSA
2007
IEEE
13 years 11 months ago
Modeling Real-time Garbage Collection Cost
Given the major advantages of productivity and safety, the use of garbage collection (GC) in real-time systems has gained increasing attention. Guaranteeing garbage collection act...
Wei Fu, Carl Hauser
FOCS
2006
IEEE
13 years 11 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...