17 search results - page 1 / 4 » Simulated annealing, its parameter settings and the longest ... |
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
GECCO
2007
Springer
13 years 10 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....
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...