17543 search results - page 420 / 3509 » Stochastic Optimization Algorithms |
157
click to vote
SOFSEM
1997
Springer
15 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
172
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
197
click to vote
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
169
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
203
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...