Sciweavers

2463 search results - page 1 / 493
» Compressing Pattern Databases
Sort
View
AAAI
2004
13 years 6 months ago
Compressing Pattern Databases
A pattern database is a heuristic function stored as a lookup table which stores the lengths of optimal solutions for instances of subproblems. All previous pattern databases had ...
Ariel Felner, Ram Meshulam, Robert C. Holte, Richa...
JAIR
2007
107views more  JAIR 2007»
13 years 4 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...
AIPS
2008
13 years 7 months ago
The Compression Power of Symbolic Pattern Databases
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 ...
Marcel Ball, Robert C. Holte
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 9 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
SPIESR
1993
125views Database» more  SPIESR 1993»
13 years 6 months ago
Self-Aligning and Compressed Autosophy Video Databases
Autosophy, an emerging new science, explains "Self-assembling Structures", such crystals or living trees, in mathematical terms. This research provides a new mathematica...
Klaus Holtz