Results 41 to 50 of about 5,432,397 (302)

Positivity-hardness results on Markov decision processes [PDF]

open access: yesTheoretiCS
This paper investigates a series of optimization problems for one-counter Markov decision processes (MDPs) and integer-weighted MDPs with finite state space.
Jakob Piribauer, Christel Baier
doaj   +1 more source

Trace Refinement in Labelled Markov Decision Processes [PDF]

open access: yesLogical Methods in Computer Science, 2020
Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent.
Nathanaël Fijalkow   +2 more
doaj   +1 more source

Nonlinearly Perturbed Birth-Death-Type Semi-Markov Processes

open access: yes, 2017
In Chapter 5, we present asymptotic expansions for stationary and conditional quasi-stationary distributions of nonlinearly perturbed birth-death-type semi-Markov processes, which play an important role in many applications.
Sergei Silvestrov   +3 more
core   +1 more source

Digital Cognitive Phenotyping for Differential Diagnosis and Monitoring in Neurological Conditions

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To assess the utility, accessibility, and equivalence to supervised scales of online cognitive assessment in older individuals with cognitive impairment. Methods Patients with Alzheimer's disease (AD, n = 31), idiopathic normal pressure hydrocephalus (iNPH, n = 26), and traumatic brain injury (TBI, n = 23) completed online cognitive ...
Martina Del Giovane   +10 more
wiley   +1 more source

Design of anti‐jamming decision‐making for cognitive radar

open access: yesIET Radar, Sonar & Navigation
With the development of electronic warfare, anti‐jamming measure becomes more and more complex. There have been certain research results on jamming strategies, but only a few research materials on anti‐jamming strategies.
Husheng Wang, Baixiao Chen, Qingzhi Ye
doaj   +1 more source

Overall computing offloading strategy based on deep reinforcement learning in vehicle fog computing

open access: yesThe Journal of Engineering, 2020
In order to solve the problem of network congestion caused by a large number of data requests generated by intelligent vehicles in LTE-V network, a brand-new fog server with fog computing function is deployed on both the cellular base stations and ...
HaiZhong Tan, Limin Zhu
doaj   +1 more source

Small sets and Markov transition densities [PDF]

open access: yes, 2002
The theory of general state-space Markov chains can be strongly related to the case of discrete state-space by use of the notion of small sets and associated minorization conditions. The general theory shows that small sets exist for all Markov chains on
Montana, Giovanni   +2 more
core   +1 more source

Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane   +3 more
wiley   +1 more source

Entropic Regularization of Markov Decision Processes

open access: yesEntropy, 2019
An optimal feedback controller for a given Markov decision process (MDP) can in principle be synthesized by value or policy iteration. However, if the system dynamics and the reward function are unknown, a learning agent must discover an optimal ...
Boris Belousov, Jan Peters
doaj   +1 more source

Comparison of Semi-Markov and Markov Processes

open access: yesThe Annals of Mathematical Statistics, 1971
Conditions are given under which a semi-Markov process $Z(t)$ can be obtained from a Markov process $Y(t)$ by a time change (i.e. $Z(t) = Y(\gamma(t))$). Estimates are given for $P\{\sup_{s\leqq t} |s - \gamma(s)| > \varepsilon\}$ and the construction is used to give conditions under which a sequence of semi-Markov processes will have the same ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy