Sciweavers

1914 search results - page 64 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
HM
2007
Springer
118views Optimization» more  HM 2007»
15 years 11 months ago
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
134
Voted
ICADL
2004
Springer
137views Education» more  ICADL 2004»
15 years 10 months ago
Using Content-Based and Link-Based Analysis in Building Vertical Search Engines
This paper reports our research in the Web page filtering process in specialized search engine development. We propose a machine-learning-based approach that combines Web content a...
Michael Chau, Hsinchun Chen
147
Voted
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 4 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
138
Voted
EVOW
2004
Springer
15 years 10 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro
141
Voted
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 4 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....