Sciweavers

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

24

SARA
2005
Springer

favoriteEmaildiscussreport

89views Artificial Intelligence» more SARA 2005»

Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains

14 years 4 months ago

Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains

Download anytime.cs.umass.edu

Natalia N. Beliaeva, Shlomo Zilberstein

Real-time Traffic

Artificial Intelligence | SARA 2005 |

claim paper

Related Content

» DomainIndependent Construction of Pattern Database Heuristics for CostOptimal Planning

» An LPBased Heuristic for Optimal Planning

» Searching Without a Heuristic Efficient Use of Abstraction

» New Search Heuristics for MaxCSP

» Generating Heuristics to Control Configuration Processes

» MIPbased heuristic for nonstandard 3Dpacking problems

» Two Techniques to Improve Finite Model Search

» Timeextended multirobot coordination for domains with intrapath constraints

» The Compression Power of Symbolic Pattern Databases

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	SARA
Authors	Natalia N. Beliaeva, Shlomo Zilberstein

Comments (0)