Relevant bibliographies by topics / Nearly completely decomposable (NCD)

Contents

  1. Journal articles
  2. Books
  3. Book chapters

Academic literature on the topic 'Nearly completely decomposable (NCD)'

Author: Grafiati
Published: 5 June 2025
Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Nearly completely decomposable (NCD).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Nearly completely decomposable (NCD)"

1

Kontovasilis, Kimon P., and Nikolas M. Mitrou. "Markov-modulated traffic with nearly complete decomposability characteristics and associated fluid queueing models." Advances in Applied Probability 27, no. 4 (1995): 1144–85. http://dx.doi.org/10.2307/1427937.

Full text
Abstract:
This paper considers fluid queuing models of Markov-modulated traffic that, due to large differences in the time-scales of events, possess structural characteristics that yield a nearly completely decomposable (NCD) state-space. Extension of domain decomposition and aggregation techniques that apply to approximating the eigensystem of Markov chains permits the approximate subdivision of the full system to a number of small, independent subsystems (decomposition phase), plus an ‘aggregative' system featuring a state-space that distinguishes only one index per subsystem (aggregation phase). Pert
APA, Harvard, Vancouver, ISO, and other styles
2

Kontovasilis, Kimon P., and Nikolas M. Mitrou. "Markov-modulated traffic with nearly complete decomposability characteristics and associated fluid queueing models." Advances in Applied Probability 27, no. 04 (1995): 1144–85. http://dx.doi.org/10.1017/s0001867800047820.

Full text
Abstract:
This paper considers fluid queuing models of Markov-modulated traffic that, due to large differences in the time-scales of events, possess structural characteristics that yield a nearly completely decomposable (NCD) state-space. Extension of domain decomposition and aggregation techniques that apply to approximating the eigensystem of Markov chains permits the approximate subdivision of the full system to a number of small, independent subsystems (decomposition phase), plus an ‘aggregative' system featuring a state-space that distinguishes only one index per subsystem (aggregation phase). Pert
APA, Harvard, Vancouver, ISO, and other styles
3

Agboola, Sunday Olanrewaju. "The Decomposition and Aggregation Algorithmic Numerical Iterative Solution Methods for the Stationary Distribution of Markov Chain." Journal of Scientific and Engineering Research 9, no. 1 (2022): 116–23. https://doi.org/10.5281/zenodo.10498342.

Full text
Abstract:
<strong>Abstract</strong> The evolution of a system is represented by transitions from one state to the next, and the system's physical or mathematical behavior can also be depicted by defining all of the numerous states it can be in and demonstrating how it moves between them. In this study, the iterative solution methods for the stationary distribution of Markov chains which start with an initial estimate of the solution vector and then alter it in such a way that it gets closer and closer to the genuine solution with each step or iteration., and also involved the matrices operation such as
APA, Harvard, Vancouver, ISO, and other styles
4

Louchard, Guy, and Guy Latouche. "Geometric bounds on iterative approximations for nearly completely decomposable Markov chains." Journal of Applied Probability 27, no. 3 (1990): 521–29. http://dx.doi.org/10.2307/3214538.

Full text
Abstract:
We consider a finite Markov chain with nearly-completely decomposable stochastic matrix. We determine bounds for the error, when the stationary probability vector is approximated via a perturbation analysis.
APA, Harvard, Vancouver, ISO, and other styles
5

Louchard, Guy, and Guy Latouche. "Geometric bounds on iterative approximations for nearly completely decomposable Markov chains." Journal of Applied Probability 27, no. 03 (1990): 521–29. http://dx.doi.org/10.1017/s0021900200039085.

Full text
Abstract:
We consider a finite Markov chain with nearly-completely decomposable stochastic matrix. We determine bounds for the error, when the stationary probability vector is approximated via a perturbation analysis.
APA, Harvard, Vancouver, ISO, and other styles
6

Dey, S. "Reduced-complexity filtering for partially observed nearly completely decomposable Markov chains." IEEE Transactions on Signal Processing 48, no. 12 (2000): 3334–44. http://dx.doi.org/10.1109/78.886997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mattingly, R. Bruce. "A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains." ORSA Journal on Computing 7, no. 2 (1995): 117–24. http://dx.doi.org/10.1287/ijoc.7.2.117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lu, Yingdong, Mark S. Squillante, and Chai Wah Wu. "Nearly Completely Decomposable Epidemic-Like Stochastic Processes with Time-Varying Behavior." ACM SIGMETRICS Performance Evaluation Review 45, no. 2 (2017): 48–50. http://dx.doi.org/10.1145/3152042.3152059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bhuvaneshwari G, Selvarani R, Suriyamathi B, Allwyn Moses M, and Kalichwaran S. "A study to evaluate the magnitude of understanding on harm’s way associated with heart disease among clients attending NCD clinic at nemam PHC." International Journal of Research in Pharmaceutical Sciences 10, no. 4 (2019): 2983–87. http://dx.doi.org/10.26452/ijrps.v10i4.1583.

Full text
Abstract:
Non-communicable Disease (NCD), almost completely heart diseases, malignancy, diabetes and chronic obstructive pulmonary diseases are the main source of demise worldwide killing additional human beings further wise entire further sources merge. In 2008 nearly two-thirds of the demises were due to NCD, a 36 million out of 57. Out of this almost completely 80% of demise happens in little and medium earnings nation with over 50% of them happening amid human beings completely amount 70 years old and 29% under 60 years of age. At current heart diseases (CVD) are the numeral single sources of demise
APA, Harvard, Vancouver, ISO, and other styles
10

Aldhaheri, R. W., and H. K. Khalil. "Aggregation of the policy iteration method for nearly completely decomposable Markov chains." IEEE Transactions on Automatic Control 36, no. 2 (1991): 178–87. http://dx.doi.org/10.1109/9.67293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Nearly completely decomposable (NCD)"

1

Graham, Horton, and Institute for Computer Applications in Science and Engineering., eds. On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Nearly completely decomposable (NCD)"

1

Latouche, Guy, and Paul J. Schweitzer. "A Markov Modulated, Nearly Completely Decomposable M/M/1 Queue." In Computations with Markov Chains. Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2241-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stewart, G. W., W. J. Stewart, and D. F. McAllistert. "A Two-Stage Iteration for Solving Nearly Completely Decomposable Markov Chains." In Recent Advances in Iterative Methods. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4613-9353-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leutenegger, Scott T., and Graham Horton. "On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains." In Computations with Markov Chains. Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2241-6_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Nearly completely decomposable (NCD)' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography