Sciweavers

70 search results - page 3 / 14
» An exploration of ranking heuristics in mobile local search
Sort
View
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 27 days ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 3 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 6 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
ICGA
1997
134views Optimization» more  ICGA 1997»
13 years 6 months ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith
IPPS
2010
IEEE
13 years 3 months ago
Large neighborhood local search optimization on graphics processing units
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...
Thé Van Luong, Nouredine Melab, El-Ghazali ...