Sciweavers

356 search results - page 31 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
ICAS
2005
IEEE
90views Robotics» more  ICAS 2005»
14 years 1 months ago
A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of provid...
Cheng-Yuan Hoa, Yi-Cheng Chan, Yaw-Chung Chen
JUCS
2010
142views more  JUCS 2010»
13 years 6 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 6 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
HPDC
2005
IEEE
14 years 1 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 5 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld