Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
18
0
1

Year Published

2005
2005
2016
2016

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 18 publications
(19 citation statements)
references
References 7 publications
0
18
0
1
Order By: Relevance
“…External A* [12] maintains the search space on disk. The priority queue data structure is represented as a list of buckets.…”
Section: External A*mentioning
confidence: 99%
See 3 more Smart Citations
“…External A* [12] maintains the search space on disk. The priority queue data structure is represented as a list of buckets.…”
Section: External A*mentioning
confidence: 99%
“…The I/O complexity for External A* in an implicit unweighted and undirected graph with monotone estimates is bounded by O(sort(|R|)+scan(|S|)), where |S| and |R| are the number of nodes and edges in the explored subgraph of the state space problem graph. It has been shown [12] that the lower bound for the delayed duplicate detection is Ω(sort(|S|)) I/Os.…”
Section: External A*mentioning
confidence: 99%
See 2 more Smart Citations
“…External algorithms [24] exploit harddisk space and organize the access to secondary memory. Originally designed for explicit graphs, external search algorithms have shown considerable performances in the large-scale breadth-first and guided exploration of single-agent games [16,9] and in the analysis of model checking problems [13,14,18]. While [14] provides a distributed implementation of [13] for model checking safety properties, a recent extension [8] extends the approach to general LTL properties.…”
Section: Introductionmentioning
confidence: 99%