Sciweavers

4488 search results - page 57 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
115
Voted
EVOW
2007
Springer
15 years 8 months ago
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
Marek Kubiak, Przemyslaw Wesolek
116
Voted
EOR
2006
129views more  EOR 2006»
15 years 2 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
111
Voted
JAR
2000
123views more  JAR 2000»
15 years 2 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
109
Voted
ICSE
1999
IEEE-ACM
15 years 7 months ago
Experience with Performing Architecture Tradeoff Analysis
Software architectures, like complex designs in any field, embody tradeoffs made by the designers. However, these tradeoffs are not always made explicitly by the designers and the...
Rick Kazman, Mario Barbacci, Mark Klein, S. Jeromy...
141
Voted
TREC
2001
15 years 4 months ago
TREC-10 Web Track Experiments at MSRA
In TREC-10, Microsoft Research Asia (MSRA) participated in the Web track (ad hoc retrieval task and homepage finding task). The latest version of the Okapi system (Windows 2000 ve...
Jianfeng Gao, Guihong Cao, Hongzhao He, Min Zhang,...