Sciweavers

13214 search results - page 379 / 2643
» Pseudorandomness for network algorithms
Sort
View
COR
2004
146views more  COR 2004»
15 years 6 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
FGCS
2000
139views more  FGCS 2000»
15 years 6 months ago
Ant algorithms
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...
Marco Dorigo, Gianni Di Caro, Thomas Stützle
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 7 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
302
Voted

Publication
314views
17 years 5 months ago
LED: Load Early Detection: A Congestion Control Algorithm based on Router Traffic Load
Efficient bandwidth allocation and low delays remain important goals, expecially in high-speed networks. Existing end-to-end congestion control schemes (such as TCP+AQM/RED) have s...
A. Durresi, P. Kandikuppa, M. Sridharan, S. Chella...
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
16 years 8 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...