default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitri Scheftelowitsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c11]Peter Buchholz, Dimitri Scheftelowitsch:
Concurrent MDPs with Finite Markovian Policies. MMB 2020: 37-53
2010 – 2019
- 2019
- [j4]Peter Buchholz
, Dimitri Scheftelowitsch:
Light robustness in the optimization of Markov decision processes with uncertain parameters. Comput. Oper. Res. 108: 69-81 (2019) - [j3]Peter Buchholz, Dimitri Scheftelowitsch:
Computation of weighted sums of rewards for concurrent MDPs. Math. Methods Oper. Res. 89(1): 1-42 (2019) - 2018
- [b1]Dimitri Scheftelowitsch:
Markov decision processes with uncertain parameters. Technical University of Dortmund, Germany, 2018 - [c10]Peter Buchholz, Iryna Dohndorf, Dimitri Scheftelowitsch:
Time-Based Maintenance Models Under Uncertainty. MMB 2018: 3-18 - [c9]Dimitri Scheftelowitsch:
Collider - Parallel Experiments in Silico. MMB 2018: 327-331 - 2017
- [j2]Peter Buchholz, Iryna Dohndorf, Dimitri Scheftelowitsch:
Optimal decisions for continuous time Markov decision processes over finite planning horizons. Comput. Oper. Res. 77: 267-278 (2017) - [c8]Peter Buchholz, Iryna Dohndorf, Dimitri Scheftelowitsch:
Analysis of Markov Decision Processes Under Parameter Uncertainty. EPEW 2017: 3-18 - [c7]Peter Buchholz, Iryna Dohndorf, Alexander Frank, Dimitri Scheftelowitsch:
Bounded Aggregation for Continuous Time Markov Decision Processes. EPEW 2017: 19-32 - [c6]Dimitri Scheftelowitsch, Peter Buchholz, Vahid Hashemi, Holger Hermanns:
Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters. VALUETOOLS 2017: 44-51 - [i1]Dimitri Scheftelowitsch, Peter Buchholz, Vahid Hashemi, Holger Hermanns:
Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters. CoRR abs/1710.08986 (2017) - 2016
- [j1]Peter Buchholz, Jan Kriege, Dimitri Scheftelowitsch:
Equivalence and Minimization for Model Checking Labeled Markov Chains. EAI Endorsed Trans. Scalable Inf. Syst. 3(11): e2 (2016) - 2015
- [c5]Marco Beccuti, Elvio Gilberto Amparore, Susanna Donatelli, Dimitri Scheftelowitsch, Peter Buchholz, Giuliana Franceschinis:
Markov Decision Petri Nets with Uncertainty. EPEW 2015: 177-192 - [c4]Dimitri Scheftelowitsch:
The Complexity of Uncertainty in Markov Decision Processes. SIAM Conf. on Control and its Applications 2015: 303-310 - [c3]Peter Buchholz, Jan Kriege, Dimitri Scheftelowitsch:
Equivalence and Minimization for Model Checking Labeled Markov Chains. VALUETOOLS 2015: 119-126 - 2014
- [c2]Peter Buchholz, Jan Kriege, Dimitri Scheftelowitsch:
Model Checking Stochastic Automata for Dependability and Performance Measures. DSN 2014: 503-514 - 2012
- [c1]Annika Jordan, Dimitri Scheftelowitsch, Jan Lahni, Jannic Hartwecker, Matthias Kuchem, Mirko Walter-Huber, Nils Vortmeier, Tim Delbrügger, Ümit Güler, Igor Vatolkin, Mike Preuss:
BeatTheBeat music-based procedural content generation in a mobile game. CIG 2012: 320-327
Coauthor Index
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 2024-04-24 22:53 CEST 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:
