Sciweavers

763 search results - page 117 / 153
» Engineering Shortest Path Algorithms
Sort
View
SIGCOMM
2004
ACM
14 years 3 months ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
COMPSAC
2003
IEEE
14 years 2 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
COLT
2004
Springer
14 years 3 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 11 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young