APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2006.06.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2731393059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contingent planning under uncertainty via stochastic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Boolean satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse sampling algorithm for near-optimal planning in large Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:36, 26 June 2024

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

    Statements

    Identifiers