scientific article; zbMATH DE number 3574935

From MaRDI portal
Revision as of 10:00, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4144754

zbMath0368.68004MaRDI QIDQ4144754

Pierre Courtois

Publication date: 1977


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (79)

Causality and model abstractionLumping and reversed processes in cooperating automataNumerically stable methods for the computation of exit rates in Markov chainsBlock iterative algorithms for stochastic matricesOn a two-level multigrid solution method for finite Markov chainsMaximum entropy two-station cyclic queues with multiple general serversEvaluating the relative operational efficiency of large-scale computer networks: An approach via data envelopment analysisAn operational view of the \(M/G/1/PS\) queueing model with IO overhead as part of serviceMultiple time scale decomposition of discrete time Markov chainsFuzzy spectral clustering by PCCA+: application to Markov state models and data classificationIterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov ChainsOn using discrete random models within decision support systemsUncoupling the Perron eigenvector problemAccelerating the Sinkhorn-Knopp iteration by Arnoldi-type methodsExact decomposition approaches for Markov decision processes: a surveyA new aggregation-disaggregation algorithmClusters in Markov chains via singular vectors of Laplacian matricesSequences of random matrices modulated by a discrete-time Markov chain*On the use of MTBDDs for performability analysis and verification of stochastic systems.Reward algorithms for semi-Markov processesAsymptotic properties of hybrid random processes modulated by Markov chainsStochastic systems arising from Markov modulated empirical measuresAnalytic approximations of queues with lightly- and heavily-correlated autoregressive service timesDiscrete-time Markov chains with two-time scales and a countable state space: limit results and queueing applicationsOptimal control of Markov chains admitting strong and weak interactionsMRE hierarchical decomposition of general queueing network modelsProof of the Simon-Ando TheoremAn Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error AnalysisAn Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error BoundBlock cyclic SOR for Markov chains with \(p\)-cyclic infinitesimal generatorA direct projection method for Markov chainsThe first Laurent series coefficients for singularly perturbed stochastic matricesEfficient simulation of Markov chains using segmentationSingularly perturbed Markov chains: Convergence and aggregationImplicit ODE solvers with good local error control for the transient analysis of Markov modelsModels of perishable queueing-inventory systems with server vacationsNORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKSNEARLY OPTIMAL CONTROL OF NONLINEAR MARKOVIAN SYSTEMS SUBJECT TO WEAK AND STRONG INTERACTIONSPerformance evaluation of cellular flexible manufacturing systems: A decomposition approachProbabilistic model checking of complex biological pathwaysStochastic Liénard Equations with Random Switching and Two-time ScalesAssociative memory design using overlapping decompositionsPerturbation analysis for denumerable Markov chains with application to queueing modelsStability of hybrid stochastic delay systems whose discrete components have a large state space: a two-time-scale approachComponentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reorderingMean value analysis of closed queueing networks with Erlang service time distributionsAn extension to Norton's equivalentPerformance-based routingAsymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes. I.Balanced realizations of regime-switching linear systemsModel reduction of general queueing networksA generalization of Norton's theorem for queueing networksAsymptotic properties of Markov-modulated random sequences with fast and slow timescalesWeak convergence of Markov-modulated random sequencesDiscrete-time singularly perturbed Markov chains: aggregation, occupation measures, and switching diffusion limitApproximate decomposition of some modulated-Poisson Voronoi tessellationsNear optimization of dynamic systems by decomposition and aggregationFuture paths for integer programming and links to artificial intelligenceMarkov reliability models of fault-tolerant distributed computing systemsAn Aggregation/Disaggregation Algorithm for Stochastic Automata NetworksApproximate lumpability for Markovian agent-based models using local symmetriesAsymptotic expansions of backward equations for two-time-scale Markov chains in continuous timeAsymptotic expansions for power-exponential moments of hitting times for nonlinearly perturbed semi-Markov processesOn a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matricesOptimal and near-optimal incentive strategies in the hierarchical control of Markov chainsOn polyhedra of Perron-Frobenius eigenvectorsPerformance measure sensitive congruences for Markovian process algebrasMARKOV DECISION PROCESSESEstimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniquesSingularly Perturbed Markov Modulated Fluid QueuesA unified view of aggregation and coherency in networks and Markov chains†Unnamed ItemEntropy maximisation and queueing network modelsIterative algorithms for large stochastic matricesMaximum entropy and the G/G/1/N queueA class of hierarchical queueing networks and their analysisHierarchical behavior in fit dynamical systemsGuaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networksAn adaptive aggregation/disaggregation algorithm for hierarchical Markovian models







This page was built for publication: