Name
Abstract | ||
|---|---|---|
In this paper, we illustrate efforts to perform memory efficient large-scale search. We first generate sets of disjoint symbolic pattern databases on disk. These pattern databases are then used for heuristic guidance, while applying explicit-state external-memory heuristic search. Different options for parallelization to save time and memory are presented. The general techniques are mapped to the (n 2 *** 1)-puzzle as a large-scale case study. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-00431-5_4 | MoChArt |
Keywords | Field | DocType |
general technique,pattern databases,memory efficient large-scale search,heuristic guidance,scaling search,different option,large-scale case study,explicit-state external-memory heuristic search,disjoint symbolic pattern databases,external memory,heuristic search | Data mining,Incremental heuristic search,Heuristic,Disjoint sets,Computer science,Binary decision diagram,Beam search,Theoretical computer science,Scaling,Database | Conference |
Volume | ISSN | Citations |
5348 | 0302-9743 | 4 |
PageRank | References | Authors |
0.41 | 32 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Edelkamp | 1 | 1557 | 125.46 |
| Shahid Jabbar | 2 | 138 | 9.03 |
| Peter Kissmann | 3 | 181 | 13.93 |