4488 search results - page 69 / 898 » Focusing Search by Using Problem Solving Experience |
143
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
146
click to vote
CPHYSICS
2011
14 years 6 months ago
2011
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
134
click to vote
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
129
click to vote
EMO
2003
Springer
15 years 8 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
139
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...