5144 search results - page 239 / 1029 » Enhancing Search with Structure |
178
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
176
click to vote
WEBDB
1998
Springer
15 years 10 months ago
1998
Springer
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
230
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
183
click to vote
AAAI
2007
15 years 8 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
179
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...