472 search results - page 73 / 95 » Design of Iterated Local Search Algorithms |
69
Voted
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
110
click to vote
TIP
1998
14 years 9 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
106
click to vote
TPDS
2002
14 years 9 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...