Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

94

Voted

KI
2009
Springer

109views Artificial Intelligence» more KI 2009»

Solving Non-deterministic Planning Problems with Pattern Database Heuristics

15 years 9 months ago

Solving Non-deterministic Planning Problems with Pattern Database Heuristics

Download www.informatik.uni-freiburg.de

Pascal Bercher, Robert Mattmüller

Real-time Traffic

Artificial Intelligence | KI 2009 |

claim paper

Related Content

» DomainIndependent Construction of Pattern Database Heuristics for CostOptimal Planning

» Partial Symbolic Pattern Databases for Optimal Sequential Planning

» Solving a RealWorld Glass Cutting Problem

» Multivalued Pattern Databases

» The Compression Power of Symbolic Pattern Databases

» SpaceEfficient MemoryBased Heuristics

» A heuristic approach for checking containment of generalized treepattern queries

» Pattern Tree Algebras Sets or Sequences

» Query Planning in the Presence of Overlapping Sources

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	KI
Authors	Pascal Bercher, Robert Mattmüller

Comments (0)