4565 search results - page 279 / 913 » Time Optimal Self-Stabilizing Algorithms |
91
Voted
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
163
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
113
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
114
Voted
BIBE
2007
IEEE
15 years 7 months ago
2007
IEEE
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
91
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...