Sciweavers

3499 search results - page 57 / 700
» On the local optimality of LambdaRank
Sort
View
128
Voted
TELSYS
2011
207views Education» more  TELSYS 2011»
14 years 4 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
ICS
2005
Tsinghua U.
15 years 3 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
CVPR
2012
IEEE
13 years 10 days ago
Locality-constrained and spatially regularized coding for scene categorization
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
Aymen Shabou, Hervé Le Borgne
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
TEC
2010
171views more  TEC 2010»
14 years 4 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li