Sciweavers

4229 search results - page 407 / 846
» On the Optimality of Spiral Search
Sort
View
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
14 years 2 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
CVPR
2012
IEEE
13 years 9 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 1 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
16 years 1 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius