Sciweavers

2343 search results - page 62 / 469
» Visual-Concept Search Solved
Sort
View
4OR
2010
82views more  4OR 2010»
15 years 4 months ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
AI
2008
Springer
15 years 4 months ago
Understanding the role of noise in stochastic local search: Analysis and experiments
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
Ole J. Mengshoel
COR
2006
108views more  COR 2006»
15 years 4 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
ENDM
2010
91views more  ENDM 2010»
15 years 1 months ago
Climbing discrepancy search for flowshop and jobshop scheduling with time lags
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
CLEF
2011
Springer
14 years 4 months ago
Search Snippet Evaluation at Yandex: Lessons Learned and Future Directions
This papers surveys different approaches to evaluation of web search summaries and describes experiments conducted at Yandex. We hypothesize that the complex task of snippet evalua...
Denis Savenkov, Pavel Braslavski, Mikhail Lebedev