Sciweavers

3049 search results - page 137 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IPCCC
2006
IEEE
15 years 10 months ago
BGP with an adaptive minimal route advertisement interval
The duration of the Minimal Route Advertisement Interval (MRAI) and the implementation of MRAI timers have a significant influence on the convergence time of the Border Gateway Pr...
Nenad Laskovic, Ljiljana Trajkovic
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
15 years 10 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 8 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 8 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
CVPR
2008
IEEE
16 years 6 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl