510 search results - page 32 / 102 » How Should We Solve Search Problems Privately |
JAR
2000
13 years 7 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
DAWAK
2011
Springer
12 years 7 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
WEBDB
2010
Springer
14 years 18 days ago
2010
Springer
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
CIAC
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
PVM
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....