Sciweavers

2880 search results - page 349 / 576
» Approximate Range Searching
Sort
View
134
Voted
SIGIR
2005
ACM
15 years 9 months ago
Scalable collaborative filtering using cluster-based smoothing
Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approache...
Gui-Rong Xue, Chenxi Lin, Qiang Yang, Wensi Xi, Hu...
135
Voted
CP
2005
Springer
15 years 9 months ago
Applying Constraint Programming to Rigid Body Protein Docking
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
Ludwig Krippahl, Pedro Barahona
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
15 years 9 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
EVOW
2005
Springer
15 years 9 months ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 9 months ago
Exploring extended particle swarms: a genetic programming approach
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
Riccardo Poli, Cecilia Di Chio, William B. Langdon