Sciweavers

70 search results - page 10 / 14
» An exploration of ranking heuristics in mobile local search
Sort
View
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
14 years 29 days ago
Fitness-based neighbor selection for multimodal function optimization
We propose a selection scheme called Fitness-based Neighbor Selection (FNS) for multimodal optimization. The FNS is aimed for ill-scaled and locally multimodal domain, both found ...
Shin Ando, Shigenobu Kobayashi
EVOW
2004
Springer
14 years 25 days 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
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
CIKM
2008
Springer
13 years 9 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church