Karel Sladký

26 papers Journal 22Unranked 4
YearRankTypeTitle / Venue / Authors
2018 J jnl
Risk-sensitive average optimality in Markov decision processes.
Kybernetika
Karel Sladký
2017 J jnl
Second order optimality in Markov decision chains.
Kybernetika
Karel Sladký
2015 J jnl
Sample-Path Optimal Stationary Policies in Stable Markov Decision Chains with the Average Reward Criterion.
J. Appl. Probab.
Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký
2014 J jnl
A Counterexample on Sample-Path Optimality in Stable Markov Decision Chains with the Average Reward Criterion.
J. Optim. Theory Appl.
Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký
2010 J jnl
Identification of optimal policies in Markov decision processes.
Kybernetika
Karel Sladký
2008 J jnl
Editorial: Sixty years of cybernetics.
Kybernetika
Lucie Fajfrová, Milan Mares, Karel Sladký
2008 J jnl
Growth rates and average optimality in risk-sensitive Markov decision chains.
Kybernetika
Karel Sladký
2007 — conf
Risk-Sensitive Average Optimality in Markov Decision Chains.
OR
Karel Sladký, Raúl Montes-de-Oca
2006 J jnl
Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case.
Kybernetika
Nico M. van Dijk, Karel Sladký
2006 J jnl
Monotonicity and comparison results for nonnegative dynamic systems. Part II: Continuous-time case.
Kybernetika
Nico M. van Dijk, Karel Sladký
2006 — conf
Risk-Sensitive Optimality Criteria in Markov Decision Processes.
OR
Karel Sladký
2005 — conf
Algorithmic Procedures for Mean Variance Optimality in Markov Decision Chains.
OR
Karel Sladký, Milan Sitar
2005 J jnl
On mean reward variance in semi-Markov processes.
Math. Methods Oper. Res.
Karel Sladký
2004 — conf
Total Reward Variance in Discrete and Continuous Time Markov Chains.
OR
Karel Sladký, Nico M. van Dijk
1994 J jnl
On sufficient conditions for the stability of dynamic interval systems.
Kybernetika
Karel Sladký
1993 J jnl
Special issue: Nondifferentiable Problems in Optimal Design.
Kybernetika
Karel Sladký
1981 J jnl
Bounds on discrete dynamic programming recursions. II. Polynomial bounds on problems with block-triangular structure.
Kybernetika
Karel Sladký
1981 J jnl
On the existence of stationary optimal policies in discrete dynamic programming.
Kybernetika
Karel Sladký
1980 J jnl
Bounds on discrete dynamic programming recursions. I. Models with non-negative matrices.
Kybernetika
Karel Sladký
1977 J jnl
Sensitive Optimality Criteria in Countable State Dynamic Programming.
Math. Oper. Res.
Arie Hordijk, Karel Sladký
1974 J jnl
On the set of optimal controls for Markov chains with rewards.
Kybernetika
Karel Sladký
1973 J jnl
Necessary and sufficient optimality conditions for average reward of controlled Markov chains.
Kybernetika
Karel Sladký
1969 J jnl
On the method of successive approximations for finding the optimal control of a Markov chain.
Kybernetika
Karel Sladký
1968 J jnl
A note on the programming in Markov-type processes.
Kybernetika
Karel Sladký
1968 J jnl
On Eaton-Zadeh's method.
Kybernetika
Karel Sladký
1967 J jnl
A problem concerning an optimal service policy for several facilities.
Kybernetika
Karel Sladký