7522 search results - page 70 / 1505 » Spacing memetic algorithms |
125
Voted
PPSN
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
80
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
87
Voted
CPM
2003
Springer
15 years 5 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
106
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the ...
78
Voted
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...