Sciweavers

1628 search results - page 151 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
115
Voted
IDA
2008
Springer
15 years 3 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
117
Voted
EVOW
2005
Springer
15 years 9 months ago
Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
Marcos H. Maruo, Heitor S. Lopes, Myriam Regattier...
108
Voted
MVA
1996
15 years 5 months ago
Inductive Learning of Primitive Shape Features of Closed Contours
A method for inductivelearningof primitive features is proposed. Primitive features are well investigated and they are extracted in bottom-up manner fiom training set of patterns ...
Ichiro Murase, Shun'ichi Kaneko, Satoru Igarashi
JAMDS
2002
155views more  JAMDS 2002»
15 years 3 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
159
Voted
WEBI
2005
Springer
15 years 9 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal