Sciweavers

16093 search results - page 375 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
180
Voted
CN
2006
74views more  CN 2006»
15 years 7 months ago
Measurement-based optimal routing on overlay architectures for unicast sessions
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overla...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
COLT
2004
Springer
16 years 8 days 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
208
Voted
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
15 years 10 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
174
Voted
AAAI
2008
15 years 9 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger