Sciweavers

9119 search results - page 68 / 1824
» A Simultaneous Search Problem
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 10 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
SIGIR
2010
ACM
13 years 4 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang
AAAI
2000
13 years 11 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
14 years 3 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
FSTTCS
1991
Springer
14 years 1 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich