Sciweavers

1550 search results - page 27 / 310
» Optimizing search by showing results in context
Sort
View
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
14 years 8 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
GECCO
2008
Springer
164views Optimization» more  GECCO 2008»
13 years 9 months ago
Genetic algorithms with local search optimization for protein structure prediction problem
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...
Igor Berenboym, Mireille Avigal
DSS
2007
122views more  DSS 2007»
13 years 7 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 8 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng