APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058)

From MaRDI portal

Revision as of 11:36, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	APPSSAT: Approximate probabilistic planning using stochastic satisfiability	scientific article

Statements

scholarly article

0 references

APPSSAT: Approximate probabilistic planning using stochastic satisfiability (English)

0 references

Stephen M. Majercik

0 references

International Journal of Approximate Reasoning

0 references

publication date

19 July 2007

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ijar.2006.06.016

0 references

Contingent planning under uncertainty via stochastic satisfiability

0 references

Stochastic Boolean satisfiability

0 references

0 references

A sparse sampling algorithm for near-optimal planning in large Markov decision processes

0 references

0 references

Games against nature

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ijar.2006.06.016

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:997058

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q997058&oldid=34982924"