Sciweavers

8746 search results - page 145 / 1750
» Diversifying search results
Sort
View
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 9 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
SAC
2002
ACM
13 years 9 months ago
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
Haibing Li, Andrew Lim
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 4 months ago
Modeling and predicting user behavior in sponsored search
Implicit user feedback, including click-through and subsequent browsing behavior, is crucial for evaluating and improving the quality of results returned by search engines. Severa...
Josh Attenberg, Sandeep Pandey, Torsten Suel
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 10 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
CSCLP
2004
Springer
14 years 2 months ago
A Value Ordering Heuristic for Local Search in Distributed Resource Allocation
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
Adrian Petcu, Boi Faltings