Bibliografias temáticas / Markoc chain

Literatura científica selecionada sobre o tema "Markoc chain"

Autor: Grafiati
Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Índice

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Markoc chain".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Markoc chain"

1

Guyo, X., e C. Hardouin†. "Markow chain markov field dynamics:models and statistics". Statistics 35, n.º 4 (janeiro de 2001): 593–627. http://dx.doi.org/10.1080/02331880108802756.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Valenzuela, Mississippi. "Markov chains and applications". Selecciones Matemáticas 9, n.º 01 (30 de junho de 2022): 53–78. http://dx.doi.org/10.17268/sel.mat.2022.01.05.

Texto completo da fonte
Resumo:
This work has three important purposes: first it is the study of Markov Chains, the second is to show that Markov chains have different applications and finally it is to model a process of this behaves. Throughout this work we will describe what a Markov chain is, what these processes are for and how these chains are classified. We will describe a Markov Chain, that is, analyze what are the primary elements that make up a Markov chain, among others.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Barker, Richard J., e Matthew R. Schofield. "Putting Markov Chains Back into Markov Chain Monte Carlo". Journal of Applied Mathematics and Decision Sciences 2007 (30 de outubro de 2007): 1–13. http://dx.doi.org/10.1155/2007/98086.

Texto completo da fonte
Resumo:
Markov chain theory plays an important role in statistical inference both in the formulation of models for data and in the construction of efficient algorithms for inference. The use of Markov chains in modeling data has a long history, however the use of Markov chain theory in developing algorithms for statistical inference has only become popular recently. Using mark-recapture models as an illustration, we show how Markov chains can be used for developing demographic models and also in developing efficient algorithms for inference. We anticipate that a major area of future research involving mark-recapture data will be the development of hierarchical models that lead to better demographic models that account for all uncertainties in the analysis. A key issue is determining when the chains produced by Markov chain Monte Carlo sampling have converged.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Marcus, Brian, e Selim Tuncel. "The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains". Ergodic Theory and Dynamical Systems 11, n.º 1 (março de 1991): 129–80. http://dx.doi.org/10.1017/s0143385700006052.

Texto completo da fonte
Resumo:
AbstractWe study Markov chains via invariants constructed from periodic orbits. Canonical extensions, based on these invariants, are used to establish a constraint on the degree of finite-to-one block homomorphisms from one Markov chain to another. We construct a polytope from the normalized weights of periodic orbits. Using this polytope, we find canonically-defined induced Markov chains inside the original Markov chain. Each of the invariants associated with these Markov chains gives rise to a scaffold of invariants for the original Markov chain. This is used to obtain counterexamples to the finite equivalence conjecture and to a conjecture regarding finitary isomorphism with finite expected coding time. Also included are results related to the problem of minimality (with respect to block homomorphism) of Bernoulli shifts in the class of Markov chains with beta function equal to the beta function of the Bernoulli shift.
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Xiang, Xuyan, Xiao Zhang e Xiaoyun Mo. "Statistical Identification of Markov Chain on Trees". Mathematical Problems in Engineering 2018 (2018): 1–13. http://dx.doi.org/10.1155/2018/2036248.

Texto completo da fonte
Resumo:
The theoretical study of continuous-time homogeneous Markov chains is usually based on a natural assumption of a known transition rate matrix (TRM). However, the TRM of a Markov chain in realistic systems might be unknown and might even need to be identified by partially observable data. Thus, an issue on how to identify the TRM of the underlying Markov chain by partially observable information is derived from the great significance in applications. That is what we call the statistical identification of Markov chain. The Markov chain inversion approach has been derived for basic Markov chains by partial observation at few states. In the current letter, a more extensive class of Markov chain on trees is investigated. Firstly, a type of a more operable derivative constraint is developed. Then, it is shown that all Markov chains on trees can be identified only by such derivative constraints of univariate distributions of sojourn time and/or hitting time at a few states. A numerical example is included to demonstrate the correctness of the proposed algorithms.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

APOSTOLOV, S. S., Z. A. MAYZELIS, O. V. USATENKO e V. A. YAMPOL'SKII. "HIGH-ORDER CORRELATION FUNCTIONS OF BINARY MULTI-STEP MARKOV CHAINS". International Journal of Modern Physics B 22, n.º 22 (10 de setembro de 2008): 3841–53. http://dx.doi.org/10.1142/s0217979208048589.

Texto completo da fonte
Resumo:
Two approaches to studying the correlation functions of the binary Markov sequences are considered. The first of them is based on the study of probability of occurring different "words" in the sequence. The other one uses recurrence relations for correlation functions. These methods are applied for two important particular classes of the Markov chains. These classes include the Markov chains with permutative conditional probability functions and the additive Markov chains with the small memory functions. The exciting property of the self-similarity (discovered in Phys. Rev. Lett.90, 110601 (2003) for the additive Markov chain with the step-wise memory function) is proved to be the intrinsic property of any permutative Markov chain. Applicability of the correlation functions of the additive Markov chains with the small memory functions to calculating the thermodynamic characteristics of the classical Ising spin chain with long-range interaction is discussed.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Masuyama, Hiroyuki. "Error Bounds for Augmented Truncations of Discrete-Time Block-Monotone Markov Chains under Geometric Drift Conditions". Advances in Applied Probability 47, n.º 1 (março de 2015): 83–105. http://dx.doi.org/10.1239/aap/1427814582.

Texto completo da fonte
Resumo:
In this paper we study the augmented truncation of discrete-time block-monotone Markov chains under geometric drift conditions. We first present a bound for the total variation distance between the stationary distributions of an original Markov chain and its augmented truncation. We also obtain such error bounds for more general cases, where an original Markov chain itself is not necessarily block monotone but is blockwise dominated by a block-monotone Markov chain. Finally, we discuss the application of our results to GI/G/1-type Markov chains.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Masuyama, Hiroyuki. "Error Bounds for Augmented Truncations of Discrete-Time Block-Monotone Markov Chains under Geometric Drift Conditions". Advances in Applied Probability 47, n.º 01 (março de 2015): 83–105. http://dx.doi.org/10.1017/s0001867800007710.

Texto completo da fonte
Resumo:
In this paper we study the augmented truncation of discrete-time block-monotone Markov chains under geometric drift conditions. We first present a bound for the total variation distance between the stationary distributions of an original Markov chain and its augmented truncation. We also obtain such error bounds for more general cases, where an original Markov chain itself is not necessarily block monotone but is blockwise dominated by a block-monotone Markov chain. Finally, we discuss the application of our results to GI/G/1-type Markov chains.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Verbeken, Brecht, e Marie-Anne Guerry. "Attainability for Markov and Semi-Markov Chains". Mathematics 12, n.º 8 (19 de abril de 2024): 1227. http://dx.doi.org/10.3390/math12081227.

Texto completo da fonte
Resumo:
When studying Markov chain models and semi-Markov chain models, it is useful to know which state vectors n, where each component ni represents the number of entities in the state Si, can be maintained or attained. This question leads to the definitions of maintainability and attainability for (time-homogeneous) Markov chain models. Recently, the definition of maintainability was extended to the concept of state reunion maintainability (SR-maintainability) for semi-Markov chains. Within the framework of semi-Markov chains, the states are subdivided further into seniority-based states. State reunion maintainability assesses the maintainability of the distribution across states. Following this idea, we introduce the concept of state reunion attainability, which encompasses the potential of a system to attain a specific distribution across the states after uniting the seniority-based states into the underlying states. In this paper, we start by extending the concept of attainability for constant-sized Markov chain models to systems that are subject to growth or contraction. Afterwards, we introduce the concepts of attainability and state reunion attainability for semi-Markov chain models, using SR-maintainability as a starting point. The attainable region, as well as the state reunion attainable region, are described as the convex hull of their respective vertices, and properties of these regions are investigated.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Ledoux, James. "A geometric invariant in weak lumpability of finite Markov chains". Journal of Applied Probability 34, n.º 4 (dezembro de 1997): 847–58. http://dx.doi.org/10.2307/3215001.

Texto completo da fonte
Resumo:
We consider weak lumpability of finite homogeneous Markov chains, which is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones that is positively invariant by the transition probability matrix of the original chain. It allows us, in a unified way, to derive new results on lumpability of reducible Markov chains and to obtain spectral properties associated with lumpability.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Teses / dissertações sobre o assunto "Markoc chain"

1

Chen, Yi ting. "Random generation of executions of concurrent systems". Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS071.pdf.

Texto completo da fonte
Resumo:
La concurrence joue un rôle important dans les systèmes et la programmation modernes. Il révèle le phénomène selon lequel plusieurs calculs s'exécutent simultanément. Ces exécutions entrelacées entraînent le "problème d'explosion d'états". Dans cette thèse, nous visons à construire un cadre probabiliste sur les exécutions de systèmes concurrents à des fins de génération aléatoire. La mesure uniforme des exécutions s'inspire des monoïdes de traces définis sur des traces infinies. La théorie des traces a une solide base combinatoire autour du polynôme de Möbius. L'irréductibilité des monoïdes de traces implique la forte connectivité du digraphe des cliques. Par conséquent, une valeur propre dominante existe et détermine le taux de croissance des monoïdes de traces. Dans notre travail, nous considérons les systèmes concurrents abstraits comme des actions de monoïdes sur un ensemble fini d'états. Ce paramètre englobe les réseaux de Petri à 1-bornés. Nous donnons deux interprétations à la mesure uniforme des exécutions pour les systèmes concurrents. La première interprétation donne la valeur de la measure uniforme sur les cylindres élémentaires du point de vue algébrique sur le monoïde de traces. Cette mesure uniforme est réalisée par une chaîne de Markov d'états-et-cliques. L'autre interprétation s'intéresse à la mesure de Parry sur le digraphe des états-et-cliques. La difficulté à étendre aux systèmes concurrents est que le théorème de Perron-Frobenius n'est pas applicable. Pour résoudre ce problème, nous avons trouvé la propriété spectrale des systèmes concurrents irréductibles. Cela nous permet de distinguer les principaux composants qui déterminent la racine caractéristique du système. Nous prouvons également l'unicité de cette mesure uniforme. La matrice de transition peut être obtenue soit à partir de la chaîne de Markov d'états-et-cliques, soit à partir de la mesure de Parry avec le rayon spectral des composantes dominantes
Concurrency has an important role in modern systems and programming. It reveals the phenomenon that multiple computations run simultaneously. These interleaved executions cause the so-called "State explosion problem". In this thesis, we aim at constructing a probabilistic framework on the executions of concurrent systems for the purpose of random generation. The uniform measure of executions is inspired by trace monoids defined on infinite traces. Trace theory has a strong combinatorial foundation around the Möbius polynomial. The irreducibility of trace monoids implies the strong connectivity of the digraph of cliques. Hence, a dominant eigenvalue exists and determines the growth rate of trace monoids. In our work, we view the abstract concurrent systems as monoid actions on a finite set of states. This setting encompasses 1-bounded Petri nets. We give two interpretations to a uniform measure of executions for concurrent systems. One is constructed by the elementary cylinders in trace monoids. This uniform measure is realized a Markov chain of states-and-cliques. The other is to study the Parry measure on the digraph of states-and-cliques. The difficulty to extend to concurrent systems is that the Perron-Frobenius theorem is not applicable. To resolve this problem, we found the spectral property of the irreducible concurrent systems. This allows us to distinguish the main components which determine the characteristic root of the system. We also prove the uniqueness of this uniform measure. The transition matrix can be obtained either from the Markov chain of states-and-cliques or from the Parry measure with the spectral radius of the dominant components
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Yildirak, Sahap Kasirga. "The Identificaton Of A Bivariate Markov Chain Market Model". Phd thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/1257898/index.pdf.

Texto completo da fonte
Resumo:
This work is an extension of the classical Cox-Ross-Rubinstein discrete time market model in which only one risky asset is considered. We introduce another risky asset into the model. Moreover, the random structure of the asset price sequence is generated by bivariate finite state Markov chain. Then, the interest rate varies over time as it is the function of generating sequences. We discuss how the model can be adapted to the real data. Finally, we illustrate sample implementations to give a better idea about the use of the model.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Lindahl, John, e Douglas Persson. "Data-driven test case design of automatic test cases using Markov chains and a Markov chain Monte Carlo method". Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-43498.

Texto completo da fonte
Resumo:
Large and complex software that is frequently changed leads to testing challenges. It is well established that the later a fault is detected in software development, the more it costs to fix. This thesis aims to research and develop a method of generating relevant and non-redundant test cases for a regression test suite, to catch bugs as early in the development process as possible. The research was executed at Axis Communications AB with their products and systems in mind. The approach utilizes user data to dynamically generate a Markov chain model and with a Markov chain Monte Carlo method, strengthen that model. The model generates test case proposals, detects test gaps, and identifies redundant test cases based on the user data and data from a test suite. The sampling in the Markov chain Monte Carlo method can be modified to bias the model for test coverage or relevancy. The model is generated generically and can therefore be implemented in other API-driven systems. The model was designed with scalability in mind and further implementations can be made to increase the complexity and further specialize the model for individual needs.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Bakra, Eleni. "Aspects of population Markov chain Monte Carlo and reversible jump Markov chain Monte Carlo". Thesis, University of Glasgow, 2009. http://theses.gla.ac.uk/1247/.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Holenstein, Roman. "Particle Markov chain Monte Carlo". Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/7319.

Texto completo da fonte
Resumo:
Markov chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) methods have emerged as the two main tools to sample from high-dimensional probability distributions. Although asymptotic convergence of MCMC algorithms is ensured under weak assumptions, the performance of these latters is unreliable when the proposal distributions used to explore the space are poorly chosen and/or if highly correlated variables are updated independently. In this thesis we propose a new Monte Carlo framework in which we build efficient high-dimensional proposal distributions using SMC methods. This allows us to design effective MCMC algorithms in complex scenarios where standard strategies fail. We demonstrate these algorithms on a number of example problems, including simulated tempering, nonlinear non-Gaussian state-space model, and protein folding.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Byrd, Jonathan Michael Robert. "Parallel Markov Chain Monte Carlo". Thesis, University of Warwick, 2010. http://wrap.warwick.ac.uk/3634/.

Texto completo da fonte
Resumo:
The increasing availability of multi-core and multi-processor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Monte Carlo (MCMC) simulations are widely used for approximate counting problems, Bayesian inference and as a means for estimating very highdimensional integrals. As such MCMC has found a wide variety of applications in fields including computational biology and physics,financial econometrics, machine learning and image processing. This thesis presents a number of new method for reducing the runtime of Markov Chain Monte Carlo simulations by using SMP machines and/or clusters. Two of the methods speculatively perform iterations in parallel, reducing the runtime of MCMC programs whilst producing statistically identical results to conventional sequential implementations. The other methods apply only to problem domains that can be presented as an image, and involve using various means of dividing the image into subimages that can be proceed with some degree of independence. Where possible the thesis includes a theoretical analysis of the reduction in runtime that may be achieved using our technique under perfect conditions, and in all cases the methods are tested and compared on selection of multi-core and multi-processor architectures. A framework is provided to allow easy construction of MCMC application that implement these parallelisation methods.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Frühwirth-Schnatter, Sylvia, Stefan Pittner, Andrea Weber e Rudolf Winter-Ebmer. "Analysing plant closure effects using time-varying mixture-of-experts Markov chain clustering". Institute of Mathematical Statistics, 2018. http://dx.doi.org/10.1214/17-AOAS1132.

Texto completo da fonte
Resumo:
In this paper we study data on discrete labor market transitions from Austria. In particular, we follow the careers of workers who experience a job displacement due to plant closure and observe - over a period of 40 quarters - whether these workers manage to return to a steady career path. To analyse these discrete-valued panel data, we apply a new method of Bayesian Markov chain clustering analysis based on inhomogeneous first order Markov transition processes with time-varying transition matrices. In addition, a mixtureof- experts approach allows us to model the probability of belonging to a certain cluster as depending on a set of covariates via a multinomial logit model. Our cluster analysis identifies five career patterns after plant closure and reveals that some workers cope quite easily with a job loss whereas others suffer large losses over extended periods of time.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Michalaros, Anastasios. "Engagement of Individual Performance in the Application of Markov Chains Models in Hellenic Navys Chain of Command". Thesis, Monterey, California. Naval Postgraduate School, 2012. http://hdl.handle.net/10945/6835.

Texto completo da fonte
Resumo:
The recent financial-crisis that Greece (Hellas) suffers has restricted and reduced the budgets of many organizations. Among those, the Hellenic ministry of defense has begun examining ways to reduce costs while maintaining operational readiness. Retirement legislation is the first area the Hellenic ministry of defense is examining. Variables such as years of service required to receive a pension, years of service by pay grade, and the skills officers should possess for promotion were examined and recorded in ordinances (directives) issued by the president of the Hellenic Republic. However, these ordinances are expected to expand the number of officers in the middle pay grades. In an attempt to deal with potential increases in middle and higher pay grades of officer inventory the Hellenic Ministry of Defense is examining an alternative plan of two parallel officer force structures war and auxiliary. The primary structure will consist of war officers. These officers are considered top performers whose careers stop at the pay grade of flag officer. The auxiliary inventory includes those officers exhibiting lower performance with the terminal pay grade of captain. The purpose of these parallel paths is to ensure all officers serve 35 years in order to receive full pensions. This thesis analyzed job performance from the perspective of experience, ability, motivation, and accomplishment of advanced degrees. It concluded that experience should be combined with education level as a reliable evaluation field. Through the use of weighting priorities, the Hellenic navy should establish job performance as a single number, or officer ranking. Thus, top performers are distinguished from officers with lower performance on periodic evaluations. Using Markov-chain models and officer scores on job performance, the war and auxiliary inventories were examined. The war inventory was then adjusted to corresponding billets at every pay grade during a five-year period. The auxiliary officers were examined for future vacancies in the war inventory.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Planting, Ralf. "The use of the DWV3 classification system in manufacturing companies for evaluating a market-specific supply chain strategy - A case study at Atlas Copco Industrial Technique". Thesis, KTH, Industriell ekonomi och organisation (Inst.), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-103925.

Texto completo da fonte
Resumo:
The research topic of this study is market-specific supply chain strategy, and the research problem is defined as, how manufacturing companies can use the DWV3 classification system to evaluate the opportunity for a market-specific supply chain strategy. What has been written about the DWV3 classification system is somewhat general in its nature and the practitioner is left without detailed instructions on how to proceed with the analytical analysis. Key elements of the DWV3 classification system that is not explicitly described in the literature is (1) how to measure each of the classification variables, (2) how to define a suitable limit for each measure in order to classify the products and (3) how to reason when sequencing the classification variables in the clustering analysis. Hence, the purpose of this thesis is to make the DWV3 classification system more available to practitioners, and thus the aim is to illustrate how to tackle the key elements of the framework by applying it on the Atlas Copco Industrial Technique Business Area product portfolio. A single-case study design was chosen as a suitable research approach for this thesis. The application of the DWV3 system to the ITBA product portfolio was considered as the phenomenon under investigation, the case, of this study. Two sets of quantitative data were collected, demand data and product master data. The qualitative data collected was related to the ITBA supply chain set-up and the products as well as the customers’ responsiveness requirements for each assortment included in the study. All qualitative data was collected through interviews. The findings of this study are summarized in a number of conclusions that can serve as guidelines for practitioners that are about to apply the DWV3 system. These are (1) as far as possible use measures at the single product level, (2) use measures that express each classification variable in a way that is relevant to the matching of demand characteristics and supply chain strategy, (3) be prepared to redefine initial measures in order to describe the studied products’ characteristics in the best possible way, (4) develop measures that are based on available data or data that is feasible to attain, (5) adjust the number of codification levels to find the best trade-off between the level of detail in the cluster analysis and the number of populated segments, (6) alter the sequencing and repeat the cluster analysis to gain insight into the demand characteristics of the product portfolio, (7) the final sequencing of the classification variables must produce clusters that are relevant for the chosen production philosophy concepts.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Martin, Russell Andrew. "Paths, sampling, and markov chain decomposition". Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/29383.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Livros sobre o assunto "Markoc chain"

1

The Markov chain. Bristol: Shearsman Books, 2017.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Gagniuc, Paul A. Markov Chains. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2017. http://dx.doi.org/10.1002/9781119387596.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Brémaud, Pierre. Markov Chains. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4757-3124-8.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Sericola, Bruno. Markov Chains. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118731543.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Douc, Randal, Eric Moulines, Pierre Priouret e Philippe Soulier. Markov Chains. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97704-1.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Graham, Carl. Markov Chains. Chichester, UK: John Wiley & Sons, Ltd, 2014. http://dx.doi.org/10.1002/9781118881866.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Brémaud, Pierre. Markov Chains. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45982-6.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Ching, Wai-Ki, Ximin Huang, Michael K. Ng e Tak-Kuen Siu. Markov Chains. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-6312-2.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Markov chains. Cambridge, UK: Cambridge University Press, 1998.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Hermanns, Holger. Interactive Markov Chains. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45804-2.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Capítulos de livros sobre o assunto "Markoc chain"

1

Camacho Olmedo, M. T., e J. F. Mas. "Markov Chain". In Geomatic Approaches for Modeling Land Change Scenarios, 441–45. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60801-3_25.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Fürnkranz, Johannes, Philip K. Chan, Susan Craw, Claude Sammut, William Uther, Adwait Ratnaparkhi, Xin Jin et al. "Markov Chain". In Encyclopedia of Machine Learning, 639. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_510.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Hu, Fuyan. "Markov Chain". In Encyclopedia of Systems Biology, 1175. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_443.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Weik, Martin H. "Markov chain". In Computer Science and Communications Dictionary, 977. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11086.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Zhang, Hao. "Markov Chain". In Models and Methods for Management Science, 383–403. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-1614-4_11.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Bandyopadhyay, Susmita. "Markov Chain". In Decision Support System, 109–24. Boca Raton: CRC Press, 2023. http://dx.doi.org/10.1201/9781003307655-8.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Rodrigues, Eliane Regina, e Jorge Alberto Achcar. "Markov Chain Models". In Applications of Discrete-time Markov Chains and Poisson Processes to Air Pollution Modeling and Studies, 11–23. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4645-3_2.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Møller, Jan Kloppenborg, Marcel Schweiker, Rune Korsholm Andersen, Burak Gunay, Selin Yilmaz, Verena Marie Barthelmes e Henrik Madsen. "Markov chain models". In Statistical Modelling of Occupant Behaviour, 253–88. Boca Raton: Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003340812-9.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Stewart, William J. "Markov Chain Equations". In Encyclopedia of Operations Research and Management Science, 921–25. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_578.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Chaudhari, Harshal A., Michael Mathioudakis e Evimaria Terzi. "Markov Chain Monitoring". In Proceedings of the 2018 SIAM International Conference on Data Mining, 441–49. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975321.50.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Markoc chain"

1

Luo, Jian-qiang, e Yan-ping Zhao. "Research on the Supply Chain Product Market Forecasting Based on Markov Chain". In 2010 International Conference on E-Product E-Service and E-Entertainment (ICEEE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iceee.2010.5660723.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Morris, Lloyd, Juan Luis Arias, Alonso Toro, Andrés Martínez e Homero Murzi. "Information management for the projection of productive capacities articulated to export scenarios". In Human Interaction and Emerging Technologies (IHIET-AI 2022) Artificial Intelligence and Future Applications. AHFE International, 2022. http://dx.doi.org/10.54941/ahfe100924.

Texto completo da fonte
Resumo:
This article proposes the management of information through the study and analysis of Colombian export scenarios that serve as a reference to articulate strategic nodes, for which an epistemological approach is proposed from a perspective of triangulation of techniques that allows a comprehensive approach in relation to the study of the external market of Colombia. This process is achieved through a comparative and complementary analysis of three techniques: Markov chains, forecasting techniques and mathematical functions. The behavior of sales is transformed into estimates of future behavior that establish a guiding mapping of the production levels that make the supply chain more dynamic. It is recommended to use time series techniques for short- and medium-term forecasts, while Markov chains for prediction and analysis of the sales structure in medium- to long-term forecasts, supported by median predictions through the use of mathematical functions.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Zhou, Qing-xin. "The Application of Markov Chain in China's Market Economy". In 2013 International Conference on Advances in Social Science, Humanities, and Management. Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/asshm-13.2013.20.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Cogill, Randy, e Erik Vargo. "The Poisson equation for reversible Markov chains: Analysis and application to Markov chain samplers". In 2012 IEEE 51st Annual Conference on Decision and Control (CDC). IEEE, 2012. http://dx.doi.org/10.1109/cdc.2012.6425978.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Arkov, V. Yu, G. G. Kulikov e T. V. Breikin. "Application of Markov Chains to Identification of Turbine Engine Dynamic Models". In ASME Turbo Expo 2002: Power for Land, Sea, and Air. ASMEDC, 2002. http://dx.doi.org/10.1115/gt2002-30038.

Texto completo da fonte
Resumo:
The paper addresses the problem of dynamic modelling of gas turbines for condition monitoring purposes. Identification of dynamic models is performed using a novel Markov chain technique. This includes identifiability analysis and model estimation. When identifying the model, experimental data should be sufficiently informative for identification. So far, identifiability analysis is weak formed and workable solutions are still to be developed. A possible technique is proposed based on non-parametric models in the form of controllable Markov chains. The second step in systems identification is the model estimation. At this stage, Markov chains are introduced to provide more functionality and versatility for dynamic modelling of gas turbines. The Markov chain model combines the deterministic and stochastic components of the engine dynamics within a single model, thus providing more exact and adequate description of the real system behaviour and leading to far more accurate health monitoring.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Talvitie, Topi, Teppo Niinimäki e Mikko Koivisto. "The Mixing of Markov Chains on Linear Extensions in Practice". In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/74.

Texto completo da fonte
Resumo:
We investigate almost uniform sampling from the set of linear extensions of a given partial order. The most efficient schemes stem from Markov chains whose mixing time bounds are polynomial, yet impractically large. We show that, on instances one encounters in practice, the actual mixing times can be much smaller than the worst-case bounds, and particularly so for a novel Markov chain we put forward. We circumvent the inherent hardness of estimating standard mixing times by introducing a refined notion, which admits estimation for moderate-size partial orders. Our empirical results suggest that the Markov chain approach to sample linear extensions can be made to scale well in practice, provided that the actual mixing times can be realized by instance-sensitive upper bounds or termination rules. Examples of the latter include existing perfect simulation algorithms, whose running times in our experiments follow the actual mixing times of certain chains, albeit with significant overhead.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Kozma, Tímea, Katalin Faragóné Lepp e Rita Szabó-Geletóczki. "Relationship Factors Between Supply Chain Actors". In 7th FEB International Scientific Conference. University of Maribor, University Press, 2023. http://dx.doi.org/10.18690/um.epf.3.2023.26.

Texto completo da fonte
Resumo:
The competition between companies is now in fact competition between value chains and supply chains. Nowadays, companies that participate in an efficiently managed supply chain based on partnerships are leading the increasingly competitive market. The companies must have recognising that the development of close strategic relationships and network cooperation between chain members is an essential part of market competition. The problem is that few company realise this yet. In the framework of the Budapest Business School Supply Chain and Value Chain Research Group, we are trying to explore the supply chain and logistics practices of Hungarian companies and institutions. Our research aims to identify the most important factors for successful business relationships. Our results show that long-term strategie business connections lead to success. Based on our research, we can say, a business point of view, trust, communication and cooperation become competitive factors.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Zhang, Yu, e Mitchell Bucklew. "Max Markov Chain". In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/639.

Texto completo da fonte
Resumo:
In this paper, we introduce Max Markov Chain (MMC), a novel model for sequential data with sparse correlations among the state variables. It may also be viewed as a special class of approximate models for High-order Markov Chains (HMCs). MMC is desirable for domains where the sparse correlations are long-term and vary in their temporal stretches. Although generally intractable, parameter optimization for MMC can be solved analytically. However, based on this result, we derive an approximate solution that is highly efficient empirically. When compared with HMC and approximate HMC models, MMC combines better sample efficiency, model parsimony, and an outstanding computational advantage. Such a quality allows MMC to scale to large domains where the competing models would struggle to perform. We compare MMC with several baselines with synthetic and real-world datasets to demonstrate MMC as a valuable alternative for stochastic modeling.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Azeraf, Elie, Emmanuel Monfrini e Wojciech Pieczynski. "On Equivalence between Linear-chain Conditional Random Fields and Hidden Markov Chains". In 14th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2022. http://dx.doi.org/10.5220/0010897400003116.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

HARA, Hisayuki, Satoshi AOKI e Akimichi TAKEMURA. "Running Markov Chain without Markov Basis". In Harmony of Gröbner Bases and the Modern Industrial Society - The Second CREST-CSBM International Conference. Singapore: World Scientific Publishing Co. Pte. Ltd., 2012. http://dx.doi.org/10.1142/9789814383462_0005.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "Markoc chain"

1

Gelfand, Alan E., e Sujit K. Sahu. On Markov Chain Monte Carlo Acceleration. Fort Belvoir, VA: Defense Technical Information Center, abril de 1994. http://dx.doi.org/10.21236/ada279393.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Krebs, William B. Markov Chain Simulations of Binary Matrices. Fort Belvoir, VA: Defense Technical Information Center, janeiro de 1992. http://dx.doi.org/10.21236/ada249265.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Banomyong, Ruth. Supply Chain Dynamics in Asia. Inter-American Development Bank, julho de 2009. http://dx.doi.org/10.18235/0011303.

Texto completo da fonte
Resumo:
Supply chain management in Asia is a relatively novel topic but a key challenge for all Asian based manufacturers and traders when trying to integrate into the "global market". The purpose of the paper is to describe key supply chain issues faced in Asia. These issues are related to supply chain security that forces Asian firms to comply with numerous requirements as well as the importance of a properly managed supply chain in enhancing firms' competitiveness. The critical role played by Asian based logistics providers in facilitating supply chain integration is explored. Logistics providers must be able to design effective and efficient supply chains for the clients. A case study is presented to illustrate how supply chain dynamics affects supplier selection. This paper was presented at The Fifth LAEBA Annual Meeting, Singapore, July 15th, 2009.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Kocherlakota, Narayana. Sluggish Inflation Expectations: A Markov Chain Analysis. Cambridge, MA: National Bureau of Economic Research, fevereiro de 2016. http://dx.doi.org/10.3386/w22009.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Calvin, James M. Markov Chain Moment Formulas for Regenerative Simulation. Fort Belvoir, VA: Defense Technical Information Center, junho de 1989. http://dx.doi.org/10.21236/ada210684.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Ketterer, Juan Antonio, e Agustina Calatayud. Integrated Value Chain Risk Management. Inter-American Development Bank, janeiro de 2016. http://dx.doi.org/10.18235/0010631.

Texto completo da fonte
Resumo:
A widespread view in the private sector is that the lack of access to finance significantly limits the entry into and the performance of value chains. Access to finance is expensive, scarce, and short term in countries in Latin America and the Caribbean, and it hampers firms' investment and the financial management required to gain entry and remain as participants in a value chain. The lack of access to finance is a consequence of a series of market failures that form the basis for public policy intervention. The region's development banks and specialized agencies have thus designed programs to ease access to value chains and improve their performance. This paper suggests that the public sector could have a more effective role in enhancing value chain access and performance by embracing an integrated risk management approach to value chains. This approach will assist thepublic sector identify the various threats to which value chains are exposed, estimate the probability of occurrence and severity of such risks, and ensure risk prevention and mitigation through the use of a cost-effective combination of financial and nonfinancial instruments.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Wereley, Norman M., e Bruce K. Walker. Approximate Evaluation of Semi-Markov Chain Reliability Models,. Fort Belvoir, VA: Defense Technical Information Center, fevereiro de 1988. http://dx.doi.org/10.21236/ada194669.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Safta, Cosmin, Mohammad Khalil e Habib N. Najm. Transitional Markov Chain Monte Carlo Sampler in UQTk. Office of Scientific and Technical Information (OSTI), março de 2020. http://dx.doi.org/10.2172/1606084.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Dabrowski, Christopher, e Fern Hunt. Markov chain analysis for large-scale grid systems. Gaithersburg, MD: National Institute of Standards and Technology, 2009. http://dx.doi.org/10.6028/nist.ir.7566.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Resnick, Sidney I., e David Zeber. Asymptotics of Markov Kernels and the Tail Chain. Fort Belvoir, VA: Defense Technical Information Center, janeiro de 2013. http://dx.doi.org/10.21236/ada585087.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Você também pode estar interessado nas extensas listas de trabalhos sobre o assunto "Markoc chain":
Artigos de revistas Teses / dissertações Livros
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!

Vá para a bibliografia