2089 search results - page 37 / 418 » A New Problem in String Searching |
CG
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
ICCAD
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
116
click to vote
ALENEX
2001
14 years 11 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
63
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
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...
CLEF
2003
Springer
15 years 2 months ago
2003
Springer
: The basic line of our action is first to use natural language processing to prune the texts and the query, and secondly to use an ontology to expand the queries. Last year The sy...