1639 search results - page 208 / 328 » Anytime Heuristic Search |
ICDE
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
GD
1999
Springer
14 years 1 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
ADBIS
2006
Springer
14 years 19 days ago
2006
Springer
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
DICS
2006
14 years 17 days ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
AIPS
2008
13 years 11 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...