About: Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Článek se zabývá problematikou výpočtu středních hodnot pro vybrané náhodné proměnné definované na bězích nekonečně-stavových Markovových řetězců. Jsou definovány abstraktní podmínky, za kterých je možno uvedené hodnoty vypočítat s libovolnou přesností. Je také ukázáno, že navržená technika je aplikovatelná na pravděpodobnostní systémy s nespolehlivými komunikačnímy kanály. (cs)
  • We consider the problem of computing the expected accumulated reward and the average gain per transition in a subclass of Markov chains with countable state spaces where all states are assigned a non-negative reward. We state several abstract conditions that guarantee computability of the above properties up to an arbitrarily small (but non-zero) given error. Finally, we show that our results can be applied to probabilistic lossy channel systems, a well-known model of processes communicating through faulty channels.
  • We consider the problem of computing the expected accumulated reward and the average gain per transition in a subclass of Markov chains with countable state spaces where all states are assigned a non-negative reward. We state several abstract conditions that guarantee computability of the above properties up to an arbitrarily small (but non-zero) given error. Finally, we show that our results can be applied to probabilistic lossy channel systems, a well-known model of processes communicating through faulty channels. (en)
Title
  • Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
  • Výpočet středních hodnot vybraných náhodných proměnných pro Markovovy řetězce s nekonečně mnoha stavy (cs)
  • Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains (en)
skos:prefLabel
  • Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
  • Výpočet středních hodnot vybraných náhodných proměnných pro Markovovy řetězce s nekonečně mnoha stavy (cs)
  • Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains (en)
skos:notation
  • RIV/00216224:14330/05:00012779!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 372-383
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
http://linked.open...iv/cisloPeriodika
  • 3821
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 516142
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/05:00012779
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Infinite Markov Chains; Expected Reward (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [57978C16E0CC]
http://linked.open...i/riv/nazevZdroje
  • Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 2005
http://linked.open...iv/tvurceVysledku
  • Brázdil, Tomáš
  • Kučera, Antonín
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software