440 search results - page 48 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
SAGA
2001
Springer
14 years 5 days ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
BMCBI
2010
13 years 7 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
CIAC
2000
Springer
14 years 2 days ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
CONSTRAINTS
2007
13 years 7 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...