Academic Journal
Προβολή σε EDS

Complexity of Finite-Horizon Markov Decision Process Problems.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Complexity of Finite-Horizon Markov Decision Process Problems.
Συγγραφείς: Mundhenk, Martin, Goldsmith, Judy
Πηγή: Journal of the ACM. Jul2000, Vol. 47 Issue 4, p681. 40p. 4 Diagrams, 3 Charts.
Θεματικοί όροι: *Markov processes, Finite element method data processing
Περίληψη: Discusses a study on the complexity of computing the optimal control policy assuming the time the process will run is finite. Details on the Markov decision processes; Factors that compound the complexity of computing optimal policy; Policy evaluation for compressed representations.
Βάση Δεδομένων: Business Source Index
FullText Links:
  – Type: other
Text:
  Availability: 0
Header DbId: bsx
DbLabel: Business Source Index
An: 3673250
RelevancyScore: 1169
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1169.251953125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Complexity of Finite-Horizon Markov Decision Process Problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mundhenk%2C+Martin%22">Mundhenk, Martin</searchLink><br /><searchLink fieldCode="AR" term="%22Goldsmith%2C+Judy%22">Goldsmith, Judy</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+the+ACM%22">Journal of the ACM</searchLink>. Jul2000, Vol. 47 Issue 4, p681. 40p. 4 Diagrams, 3 Charts.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+element+method+data+processing%22">Finite element method data processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Discusses a study on the complexity of computing the optimal control policy assuming the time the process will run is finite. Details on the Markov decision processes; Factors that compound the complexity of computing optimal policy; Policy evaluation for compressed representations.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=3673250
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/347476.347480
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 40
        StartPage: 681
    Subjects:
      – SubjectFull: Markov processes
        Type: general
      – SubjectFull: Finite element method data processing
        Type: general
    Titles:
      – TitleFull: Complexity of Finite-Horizon Markov Decision Process Problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mundhenk, Martin
      – PersonEntity:
          Name:
            NameFull: Goldsmith, Judy
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 00045411
          Numbering:
            – Type: volume
              Value: 47
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of the ACM
              Type: main
ResultId 1