Sciweavers

6976 search results - page 23 / 1396
» The Oil Searching Problem
Sort
View
4OR
2010
82views more  4OR 2010»
14 years 10 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
EOR
2008
84views more  EOR 2008»
14 years 10 months ago
Complexity of local search for the p-median problem
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
14 years 10 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 9 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...