477 search results - page 60 / 96 » Storing RDF as a Graph |
CCR
2004
13 years 9 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— The creation of a robot capable of navigating in unknown urban environments without the use of GPS data or prior map knowledge is envisioned in the Autonomous City Explorer (AC...
VLSID
2000
IEEE
14 years 2 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
GVD
2001
13 years 11 months ago
2001
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
CI
1998
13 years 9 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....