Sciweavers

65 search results - page 1 / 13
» Efficient Memory Bound Puzzles Using Pattern Databases
Sort
View
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
13 years 8 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
SARA
2005
Springer
13 years 10 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
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...
CIKM
2004
Springer
13 years 8 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling