672 search results - page 22 / 135 » Almost Optimal Dispersers |
ATAL
2008
Springer
13 years 12 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
Image thresholding is one of the most common image processing operations, since almost all image processing schemes need some sort of separation of the pixels into different class...
AE
2005
Springer
14 years 3 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...