9119 search results - page 78 / 1824 » A Simultaneous Search Problem |
TAINN
2005
Springer
14 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
4OR
2010
13 years 10 months ago
2010
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
EOR
2008
13 years 10 months ago
2008
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...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
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...