default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarel Sladký
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j22]Karel Sladký:
Risk-sensitive average optimality in Markov decision processes. Kybernetika 54(6): 1218-1230 (2018)- 2017
- [j21]Karel Sladký:
Second order optimality in Markov decision chains. Kybernetika 53(6): 1086-1099 (2017) - 2015
- [j20]Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký:
Sample-Path Optimal Stationary Policies in Stable Markov Decision Chains with the Average Reward Criterion. J. Appl. Probab. 52(2): 419-440 (2015) - 2014
- [j19]Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký:
A Counterexample on Sample-Path Optimality in Stable Markov Decision Chains with the Average Reward Criterion. J. Optim. Theory Appl. 163(2): 674-684 (2014) - 2010
- [j18]Karel Sladký:
Identification of optimal policies in Markov decision processes. Kybernetika 46(3): 558-570 (2010)
2000 – 2009
- 2008
- [j17]Karel Sladký:
Growth rates and average optimality in risk-sensitive Markov decision chains. Kybernetika 44(2): 205-226 (2008) - [j16]Lucie Fajfrová, Milan Mares, Karel Sladký:
Editorial: Sixty years of cybernetics. Kybernetika 44(3): 297-298 (2008) - 2007
- [c4]Karel Sladký, Raúl Montes-de-Oca:
Risk-Sensitive Average Optimality in Markov Decision Chains. OR 2007: 69-74 - 2006
- [j15]Nico M. van Dijk, Karel Sladký:
Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case. Kybernetika 42(1): 37-56 (2006) - [j14]Nico M. van Dijk, Karel Sladký:
Monotonicity and comparison results for nonnegative dynamic systems. Part II: Continuous-time case. Kybernetika 42(2): 161-180 (2006) - [c3]Karel Sladký:
Risk-Sensitive Optimality Criteria in Markov Decision Processes. OR 2006: 555-561 - 2005
- [j13]Karel Sladký:
On mean reward variance in semi-Markov processes. Math. Methods Oper. Res. 62(3): 387-397 (2005) - [c2]Karel Sladký, Milan Sitar:
Algorithmic Procedures for Mean Variance Optimality in Markov Decision Chains. OR 2005: 799-804 - 2004
- [c1]Karel Sladký, Nico M. van Dijk:
Total Reward Variance in Discrete and Continuous Time Markov Chains. OR 2004: 319-326
1990 – 1999
- 1994
- [j12]Karel Sladký:
On sufficient conditions for the stability of dynamic interval systems. Kybernetika 30(5): 525-536 (1994) - 1993
- [j11]Karel Sladký:
Special issue: Nondifferentiable Problems in Optimal Design. Kybernetika 29(3): 209 (1993)
1980 – 1989
- 1981
- [j10]Karel Sladký:
Bounds on discrete dynamic programming recursions. II. Polynomial bounds on problems with block-triangular structure. Kybernetika 17(4): 310-328 (1981) - [j9]Karel Sladký:
On the existence of stationary optimal policies in discrete dynamic programming. Kybernetika 17(6): 489-513 (1981) - 1980
- [j8]Karel Sladký:
Bounds on discrete dynamic programming recursions. I. Models with non-negative matrices. Kybernetika 16(6): 526-547 (1980)
1970 – 1979
- 1977
- [j7]Arie Hordijk, Karel Sladký:
Sensitive Optimality Criteria in Countable State Dynamic Programming. Math. Oper. Res. 2(1): 1-14 (1977) - 1974
- [j6]Karel Sladký:
On the set of optimal controls for Markov chains with rewards. Kybernetika 10(4): 350-367 (1974) - 1973
- [j5]Karel Sladký:
Necessary and sufficient optimality conditions for average reward of controlled Markov chains. Kybernetika 9(2): 124-137 (1973)
1960 – 1969
- 1969
- [j4]Karel Sladký:
On the method of successive approximations for finding the optimal control of a Markov chain. Kybernetika 5(2): 167-176 (1969) - 1968
- [j3]Karel Sladký:
A note on the programming in Markov-type processes. Kybernetika 4(2): 144-150 (1968) - [j2]Karel Sladký:
On Eaton-Zadeh's method. Kybernetika 4(4): 342-355 (1968) - 1967
- [j1]Karel Sladký:
A problem concerning an optimal service policy for several facilities. Kybernetika 3(4): 352-376 (1967)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
