Relevant bibliographies by topics / OR with probabilistic transitions

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'OR with probabilistic transitions'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

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 'OR with probabilistic transitions.'

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 "OR with probabilistic transitions"

1

Khimenko, V. I. "Random processes with random transitions between stable states." Information and Control Systems, no. 3 (June 21, 2019): 82–93. http://dx.doi.org/10.31799/1684-8853-2019-3-82-93.

Full text
Abstract:
Introduction: Studying random processes with several stable states and random transitions between them is important because it opens a wide range of practical problems. The detailed information structure is not studied well enough, and there is no unified approach to the description and probabilistic analysis of such processes.Purpose: Studying the main probabilistic characteristics of random processes with two stable states, and probabilistic analysis of control over chaotic transitions under various control actions.Results: We show the ways to represent and preliminarily analyze random processes with two stable states on the phase plane and in the pseudophase space. A general probabilistic model for the processes in question is proposed in the form of a two-component probabilistic «mixture» of distributions. A probabilistic analysis was carried out for the principles of control over random transitions between different states. We have defined the basic probabilistic characteristics for the processes in a management action with a variety of spectral-correlation properties and a changeable threshold for random transitions. The Poisson model of a random transition flow is analyzed with an example of «high» threshold levels.Practical relevance: The methods of visual, qualitative and analytical research in studying dynamic systems with several stable states can be combined. The proposed probabilistic models, regardless of the physical nature of the processes under consideration, can be used in problems of probabilistic analysis, control over probabilistic structure of random transitions, and simulation of physical, technical or biological systems with random switching.
APA, Harvard, Vancouver, ISO, and other styles
2

Groote, J. F., H. J. Rivera Verduzco, and E. P. de Vink. "An efficient algorithm to determine probabilistic bisimulation." Algorithms 11, no. 9 (2018): 131. http://dx.doi.org/10.3390/a11090131.

Full text
Abstract:
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved.
APA, Harvard, Vancouver, ISO, and other styles
3

Ciobanu, Gabriel, and Laura Cornacel. "Probabilistic transitions for P systems." Progress in Natural Science 17, no. 4 (2007): 432–41. http://dx.doi.org/10.1080/10020070708541020.

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

Itoh, Sanae-I., Shinichiro Toda, Masatoshi Yagi, Kimitaka Itoh, and Atsushi Fukuyama. "Probabilistic Excitation of Plasma Transitions." Journal of the Physical Society of Japan 67, no. 12 (1998): 4080–83. http://dx.doi.org/10.1143/jpsj.67.4080.

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

Jabarov, S. H., R. T. Aliyev, and N. A. Ismayilova. "Probabilistic model of structural phase transition in perovskites." Modern Physics Letters B 35, no. 12 (2021): 2150211. http://dx.doi.org/10.1142/s0217984921502110.

Full text
Abstract:
In this work, the crystal structures and phase transitions of compounds with perovskite structure were investigated. The classification of structural phase transitions in perovskites was carried out, the most common crystal structures and structural phase transitions were shown. A mathematical model was constructed, a theorem was given and proved for the probability of a possible transition. The formulas [Formula: see text] and [Formula: see text] are given for the mathematical expectation and variance of random variable [Formula: see text], which is the moment when the stochastic process [Formula: see text] deviation from the boundary [0, [Formula: see text]] interval for the first time. According to the mathematical model, one of the trajectories of random processes corresponding to the phase transitions that occur in perovskites is constructed.
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Yi Sheng, and Ho Shan Chiang. "Enhancement of a Fault Measure for AMSs Using Probabilistic Timed Automata." Advanced Materials Research 317-319 (August 2011): 681–84. http://dx.doi.org/10.4028/www.scientific.net/amr.317-319.681.

Full text
Abstract:
A novel approach for probabilistic timed structure that is based on combining the formalisms of timed automata and probabilistic automata representation of the system is proposed. Due to their real-valued clocks can measure the passage of time and transitions can be probabilistic such that it can be expressed as a discrete probability distribution on the set of target states. The usage of clock variables and the specification of state space are illustrated with real value time applications. The transitions between states are probabilistic by events which describe either the occurrence of faults or normal working conditions. Additionally, the passage of discrete time and transitions can be probabilistic by mean of the theory of expectation sets to obtain a unified measure reasoning strategy.
APA, Harvard, Vancouver, ISO, and other styles
7

FRANK, T. D. "A SYNERGETIC GAIT TRANSITION MODEL FOR HYSTERETIC GAIT TRANSITIONS FROM WALKING TO RUNNING." Journal of Biological Systems 24, no. 01 (2016): 51–61. http://dx.doi.org/10.1142/s0218339016500030.

Full text
Abstract:
A model for gait transitions from walking to running is proposed. The model is based on the theory of pattern formation and synergetics. Walking and running are considered as spatiotemporal patterns, while walk-to-run and run-to-walk transitions are regarded as bifurcations. Consequently, the model is cast in the form of coupled amplitude equations as known in the literature on pattern formation. It is shown that the model can reproduce hysteretic gait transitions that have been observed in experimental studies with humans walking on treadmills when locomotion speed is gradually increased and decreased. The control parameter is an appropriately rescaled velocity measure, the so-called Froude number, which is a body-scaled parameter that takes leg length into account. It is shown that the model can reproduce observed gait transitions for individuals and populations. In particular, probabilistic functions describing gait transitions on the population level can be defined that resemble the experimentally determined probabilistic function.
APA, Harvard, Vancouver, ISO, and other styles
8

Alves, S. G., and J. G. Moreira. "Transitions in a probabilistic interface growth model." Journal of Statistical Mechanics: Theory and Experiment 2011, no. 04 (2011): P04022. http://dx.doi.org/10.1088/1742-5468/2011/04/p04022.

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

Andova, S., and T. A. C. Willemse. "Equivalences for Silent Transitions in Probabilistic Systems." Electronic Notes in Theoretical Computer Science 128, no. 2 (2005): 53–66. http://dx.doi.org/10.1016/j.entcs.2004.11.028.

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

Troyer, Todd W., Michael S. Brainard, and Kristofer E. Bouchard. "Timing during transitions in Bengalese finch song: implications for motor sequencing." Journal of Neurophysiology 118, no. 3 (2017): 1556–66. http://dx.doi.org/10.1152/jn.00296.2017.

Full text
Abstract:
To investigate mechanisms of action sequencing, we examined the relationship between timing and sequencing of syllables in Bengalese finch song. An individual’s song comprises acoustically distinct syllables organized into probabilistic sequences: a given syllable potentially can transition to several different syllables (divergence points), and several different syllables can transition to a given syllable (convergence points). In agreement with previous studies, we found that more probable transitions at divergence points occur with shorter intersyllable gaps. One intuition for this relationship is that selection between syllables reflects a competitive branching process, in which stronger links to one syllable lead to both higher probabilities and shorter latencies for transitions to that syllable vs. competing alternatives. However, we found that simulations of competitive race models result in overlapping winning-time distributions for competing outcomes and fail to replicate the strong negative correlation between probability and gap duration found in song data. Further investigation of song structure revealed strong positive correlation between gap durations for transitions that share a common convergent point. Such transitions are not related by a common competitive process, but instead reflect a common terminal syllable. In contrast to gap durations, transition probabilities were not correlated at convergence points. Together, our data suggest that syllable selection happens early during the gap, with gap timing determined chiefly by the latency to syllable initiation. This may result from a process in which probabilistic sequencing is first stabilized, followed by a shortening of the latency to syllables that are sung more often. NEW & NOTEWORTHY Bengalese finch songs consist of probabilistic sequences of syllables. Previous studies revealed a strong negative correlation between transition probability and the duration of intersyllable gaps. We show here that the negative correlation is inconsistent with previous suggestions that timing at syllable transitions is governed by a race between competing alternatives. Rather, the data suggest that syllable selection happens early during the gap, with gap timing determined chiefly by the latency to syllable initiation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "OR with probabilistic transitions"

1

Lees, Benjamin T. "Quantum spin systems, probabilistic representations and phase transitions." Thesis, University of Warwick, 2016. http://wrap.warwick.ac.uk/82123/.

Full text
Abstract:
This thesis investigates properties of classical and quantum spin systems on lattices. These models have been widely studied due to their relevance to condensed matter physics. We identify the ground states of an antiferromagnetic RP2 model, these ground states are very di�erent from the ferromagnetic model and there was some disagreement over their structure, we settle this disagreement. Correlation inequalities are proved for the spin- 1/2 XY model and the ground state of the spin-1 XY model. This provides fresh results in a topic that had been stagnant and allows the proof of some new results, for example existence of some correlation functions in the thermodynamic limit. The occurrence of nematic order at low temperature in a quantum nematic model is proved using the method of reflection positivity and infrared bounds. Previous results on this nematic order were achieved indirectly via a probabilistic representation. This result is maintained in the presence of a small antiferromagnetic interaction, this case was not previously covered. Probabilistic representations for quantum spin systems are introduced and some consequences are presented. In particular, N´eel order is proved in a bilinear-biquadratic spin-1 system at low temperature. This result extends the famous result of Dyson, Lieb and Simon [35]. Dilute spin systems are introduced and the occurrence of a phase transition at low temperature characterised by preferential occupation of the even or odd sublattice of a cubic box is proved. This result is the first of its type for such a mixed classical and quantum system. A probabilistic representation of the spin-1 Bose-Hubbard model is also presented and some consequences are proved.
APA, Harvard, Vancouver, ISO, and other styles
2

Sato, Tetsuya. "Identifying All Preorders on the Subdistribution Monad." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199080.

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

Xia, Victoria(Victoria F. ). "Learning of probabilistic transition models for robotic actions via templates." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/121497.

Full text
Abstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 71-72).<br>In this work we present templates as an approach for learning probabilistic transition models for actions. By constructing templates via a greedy procedure for building up lists of deictic references that select relevant objects to pass to a predictor, we learn compact representations for a transition model whose training time and performance do not suffer from the presence of additional objects in more complex scenes. We present various algorithms for simultaneously separating training data into corresponding templates and learning template parameters, through the use of clustering-based approaches for initial assignment of samples to templates, followed by EM-like methods to further separate the data and train templates. We evaluate templates on variants of a simulated, 3D table-top pushing task involving stacks of objects. In comparing our approach to a baseline that considers all objects in the scene, we find that the templates approach is more data-efficient in terms of impact of number of training samples on performance.<br>by Victoria Xia.<br>M. Eng.<br>M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
4

Workman, Michael. "On Probabilistic Transition Rates Used in Markov Models for Pitting Corrosion." University of Akron / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=akron1396448113.

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

Delgado, Daniel Javier Casani. "Planejamento probabilístico como busca num espaço de transição de estados." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04062013-060258/.

Full text
Abstract:
Um dos modelos mais usados para descrever problemas de planejamento probabilístico, i.e., planejamento de ações com efeitos probabilísticos, é o processo de decisão markoviano (Markov Decision Process - MDP). Soluções tradicionais são baseadas em programação dinâmica, sendo as mais ecientes aquelas baseadas em programação dinâmica em tempo real (Real-Time Dynamic Programming - RTDP), por explorarem somente os estados alcançáveis a partir de um dado estado inicial. Por outro lado, existem soluções ecientes baseadas em métodos de busca heurística em um grafo AND/OR, sendo que os nós AND representam os efeitos probabilísticos das ações e os nós OR representam as escolhas de ações alternativas. Tais soluções também exploram somente estados alcançáveis a partir de um estado inicial porém, guardam um subgrafo solução parcial e usam programação dinâmica para a atualização do custo dos nós desse subgrafo. No entanto, problemas com grandes espaços de estados limitam o uso prático desses métodos. MDPs fatorados permitem explorar a estrutura do problema, representando MDPs muito grandes de maneira compacta e assim, favorecer a escalabilidade das soluções. Neste trabalho, apresentamos uma análise comparativa das diferentes soluções para MDPs, com ênfase naquelas que fazem busca heurística e as comparamos com soluções baseadas em programação dinâmica assíncrona, consideradas o estado da arte das soluções de MPDs. Além disso, propomos um novo algoritmo de busca heurística para MDPs fatorados baseado no algoritmo ILAO* e o testamos nos problemas da competição de planejamento probabilístico IPPC-2011.<br>One of the most widely used models to describe probabilistic planning problems, i.e., planning of actions with probabilistic eects, is the Markov Decision Process - MDP. The traditional solutions are based on dynamic programming, whereas the most ecient solutions are based on Real-Time Dynamic Programming - RTDP, which explore only the reachable states from a given initial state. Moreover, there are ecient solutions based on search methods in a AND/OR graph, where AND nodes represent the probabilistic eects of an action and OR nodes represent the choices of alternative actions. These solutions also explore only reachable states but maintain the parcial subgraph solution, using dynamic programming for updating the cost of nodes of these subgraph. However, problems with large state spaces limit the practical use of these methods. Factored representation of MDPs allow to explore the structure of the problem, and can represent very large MDPs compactly and thus improve the scalability of the solutions. In this dissertation, we present a comparative analysis of dierent solutions for MDPs, with emphasis on heuristic search methods. We compare the solutions which are based on asynchronous dynamic programming which are also considered the state of the art. We also propose a new factored algorithm based on the search algorithm ILAO*. It is also tested by using the problems of the International Probabilistic Planning Competition IPPC-2011.
APA, Harvard, Vancouver, ISO, and other styles
6

Bona, Glauber De. "Satisfazibilidade probabilística." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-02062011-181639/.

Full text
Abstract:
Este trabalho estuda o problema da Satisfazibilidade Probabilística (PSAT), revendo a sua solução via programação linear, além de propor novos algoritmos para resolvê-lo através da redução ao SAT. Construímos uma redução polinomial do PSAT para o SAT, chamada de Redução Canônica, codificando operações da aritmética racional em bits, como variáveis lógicas. Analisamos a complexidade computacional dessa redução e propomos uma Redução Canônica de Precisão Limitada para contornar tal complexidade. Apresentamos uma Redução de Turing do PSAT ao SAT, baseada no algoritmo Simplex e na Forma Normal Atômica que introduzimos. Sugerimos modificações em tal redução em busca de eficiência computacional. Por fim, implementamos essas reduções a m de investigar o perl de complexidade do PSAT, observamos o fenômeno de transição de fase e discutimos as condições para sua detecção.<br>This work studies the Probabilistic Satisfiability problem (PSAT), reviewing its solution through linear programming, and proposing new algorithms to solve it. We construct a polynomial many-to-one reduction from PSAT to SAT, called Canonical Reduction, codifying rational arithmetic operations into bits, as logical variables. We analyze the computational complexity of this reduction and we propose a Limited Precision Canonical Reduction to reduce such complexity. We present a Turing Reduction from PSAT to SAT, based on the Simplex algorithm and the Atomic Normal Form we introduced. We suggest modifications in such reduction looking for computational eficiency. Finally, we implement these reductions in order to investigate the complexity profile of PSAT, the phase transition phenomenom is observed and the conditions for its detection are discussed.
APA, Harvard, Vancouver, ISO, and other styles
7

Khapko, Taras. "Edge states and transition to turbulence in boundary layers." Doctoral thesis, KTH, Stabilitet, Transition, Kontroll, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186038.

Full text
Abstract:
The focus of this thesis is the numerical study of subcritical transition to turbulence in boundary-layer flows. For the most part, boundary layers with uniform suction are considered. Constant homogeneous suction counteracts the spatial growth of the boundary layer, rendering the flow parallel. This enables research approaches which are not feasible in the context of spatially developing flows. In the first part, the laminar–turbulent separatrix of the asymptotic suction boundary layer (ASBL) is investigated numerically by means of an edge-tracking algorithm. The obtained edge states experience recurrent dynamics, going through calm and bursting phases. The self-sustaining mechanism bears many similarities with the classical regeneration cycle of near-wall turbulence. The recurrent simple structure active during calm phases is compared to the nucleation of turbulence events in bypass transition originating from delocalised initial conditions. The implications on the understanding of the bypass-transition process and the edge state's role are discussed. Based on this understanding, a model is constructed which predicts the position of the nucleation of turbulent spots during free-stream turbulence induced transition in spatially developing boundary-layer flow. This model is used together with a probabilistic cellular automaton (PCA), which captures the spatial spreading of the spots, correctly reproducing the main statistical characteristics of the transition process. The last part of the thesis is concerned with the spatio-temporal aspects of turbulent ASBL in extended numerical domains near the onset of sustained turbulence. The different behaviour observed in ASBL, i.e. absence of sustained laminar–turbulent patterns, which have been reported in other wall-bounded flows, is associated with different character of the large-scale flow. In addition, an accurate quantitative estimate for the lowest Reynolds number with sustained turbulence is obtained<br><p>QC 20160429</p>
APA, Harvard, Vancouver, ISO, and other styles
8

Lancaster, Joseph Paul Jr. "Predicting the behavior of robotic swarms in discrete simulation." Diss., Kansas State University, 2015. http://hdl.handle.net/2097/18980.

Full text
Abstract:
Doctor of Philosophy<br>Department of Computing and Information Sciences<br>David Gustafson<br>We use probabilistic graphs to predict the location of swarms over 100 steps in simulations in grid worlds. One graph can be used to make predictions for worlds of different dimensions. The worlds are constructed from a single 5x5 square pattern, each square of which may be either unoccupied or occupied by an obstacle or a target. Simulated robots move through the worlds avoiding the obstacles and tagging the targets. The interactions between the robots and the robots and the environment lead to behavior that, even in deterministic simulations, can be difficult to anticipate. The graphs capture the local rate and direction of swarm movement through the pattern. The graphs are used to create a transition matrix, which along with an occupancy matrix, can be used to predict the occupancy in the patterns in the 100 steps using 100 matrix multiplications. In the future, the graphs could be used to predict the movement of physical swarms though patterned environments such as city blocks in applications such as disaster response search and rescue. The predictions could assist in the design and deployment of such swarms and help rule out undesirable behavior.
APA, Harvard, Vancouver, ISO, and other styles
9

Stec, Mateusz. "Micromechanical modeling of cleavage fracture in polycrystalline materials." Doctoral thesis, Stockholm : Hållfasthetslära, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9773.

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

Henestroza, Anguiano Enrique. "Analyse syntaxique probabiliste en dépendances : approches efficaces à large contexte avec ressources lexicales distributionnelles." Phd thesis, Université Paris-Diderot - Paris VII, 2013. http://tel.archives-ouvertes.fr/tel-00860720.

Full text
Abstract:
Cette thèse présente des méthodes pour améliorer l'analyse syntaxique probabiliste en dépendances. Nous employons l'analyse à base de transitions avec une modélisation effectuée par des machines à vecteurs supports (Cortes and Vapnik, 1995), et nos expériences sont réalisées sur le français. L'analyse a base de transitions est rapide, de par la faible complexité des algorithmes sous-jacents, eux mêmes fondés sur une optimisation locale des décisions d'attachement. Ainsi notre premier fil directeur est d'élargir le contexte syntaxique utilisé. Partant du système de transitions arc-eager (Nivre, 2008), nous proposons une variante qui considère simultanément plusieurs gouverneurs candidats pour les attachements à droite. Nous testons aussi la correction des analyses, inspirée par Hall and Novák (2005), qui révise chaque attachement en choisissant parmi plusieurs gouverneurs alternatifs dans le voisinage syntaxique. Nos approches améliorent légèrement la précision globale ainsi que celles de l'attachement des groupes prépositionnels et de la coordination. Notre deuxième fil explore des approches semi-supervisées. Nous testons l'auto-entrainement avec un analyseur en deux étapes, basé sur McClosky et al. (2006), pour le domaine journalistique ainsi que pour l'adaptation au domaine médical. Nous passons ensuite à la modélisation lexicale à base de corpus, avec des classes lexicales généralisées pour réduire la dispersion des données, et des préférences lexicales de l'attachement des groupes prépositionnels pour aider à la désambiguïsation. Nos approches améliorent, dans certains cas, la précision et la couverture de l'analyseur, sans augmenter sa complexité théorique.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "OR with probabilistic transitions"

1

Haenni, Rolf, Jan-Willem Romeijn, Gregory Wheeler, and Jon Williamson. Probabilistic Logics and Probabilistic Networks. Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-0008-6.

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

Probabilistic logics and probabilistic networks. Springer, 2011.

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

Probabilistic databases. Morgan & Claypool, 2011.

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

Mitrani, I. Probabilistic modelling. Cambridge University Press, 1998.

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

name, No. Probabilistic linguistics. MIT Press, 2003.

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

Eells, Ellery. Probabilistic causality. Cambridge University Press, 1991.

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

Probabilistic inequalities. World Scientific, 2010.

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

Thrun, Sebastian. Probabilistic robotics. MIT Press, 2005.

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

Chernoff, Egan J., and Bharath Sriraman, eds. Probabilistic Thinking. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-007-7155-0.

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

Paass, Gerhard. Probabilistic logic. Gesellschaft fur Mathematik und Datenverarbeitung, 1987.

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

Book chapters on the topic "OR with probabilistic transitions"

1

Piech, Henryk, and Olga Siedlecka-Lamch. "Interval Probabilities of State Transitions in Probabilistic Automata." In Artificial Intelligence and Soft Computing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29350-4_81.

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

Bidaux, R., N. Boccara, and H. Chaté. "Phase Transitions of Two-State Probabilistic Cellular Automata with One Absorbing Phase." In Springer Proceedings in Physics. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-75259-9_7.

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

Leigh, Elyssebeth, and Elizabeth Tipton. "Transitions – From Deterministic to Probabilistic Learning Conditions - Managing Simulations in Complex Conditions." In Simulation Gaming. Applications for Sustainable Cities and Smart Infrastructures. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91902-7_18.

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

van Breugel, Franck, and James Worrell. "Towards Quantitative Verification of Probabilistic Transition Systems." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_35.

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

Maler, Oded. "A decomposition theorem for probabilistic transition systems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56503-5_33.

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

Nasr, Alexis, and Owen Rambow. "Parsing with Lexicalized Probabilistic Recursive Transition Networks." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780885_16.

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

Bagnoli, Franco, Fabio Franci, and Raúl Rechtman. "Opinion Formation and Phase Transitions in a Probabilistic Cellular Automaton with Two Absorbing States." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45830-1_24.

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

Goy, Alexandre, and Jurriaan Rot. "(In)finite Trace Equivalence of Probabilistic Transition Systems." In Coalgebraic Methods in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00389-0_7.

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

Vink, E. P., and J. J. M. M. Rutten. "Bisimulation for probabilistic transition systems: A coalgebraic approach." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63165-8_202.

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

Tarkhamtham, Payap, Woraphon Yamaka, and Songsak Sriboonchitta. "Modeling the Dependence Among Crude Oil, Stock and Exchange Rate: A Bayesian Smooth Transition Vector Autoregression." In Beyond Traditional Probabilistic Methods in Economics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04200-4_59.

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

Conference papers on the topic "OR with probabilistic transitions"

1

"Collective Probabilistic Dynamical Modeling of Sleep Stage Transitions." In International Conference on Bio-inspired Systems and Signal Processing. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004243102090214.

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

Murray, Kevin E., Andrea Suardi, Vaughn Betz, and George Constantinides. "Quantifying error: Extending static timing analysis with probabilistic transitions." In 2017 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2017. http://dx.doi.org/10.23919/date.2017.7927226.

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

Ghasemieh, Hamed, Anne Remke, Boudewijn R. Haverkort, and Gianfranco Ciardo. "Approximate Analysis of Hybrid Petri Nets with Probabilistic Timed Transitions." In 9th EAI International Conference on Performance Evaluation Methodologies and Tools. ICST, 2016. http://dx.doi.org/10.4108/eai.4-1-2016.151093.

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

Dutuit, Y., C. Folleau, J.-P. Signoret, and P. Thomas. "Dynamic Transitions: Simulating Changes of Probabilistic Laws at Discrete Instants." In Proceedings of the 29th European Safety and Reliability Conference (ESREL). Research Publishing Services, 2020. http://dx.doi.org/10.3850/978-981-14-8593-0_3512-cd.

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

Huang, Haomiao, Kaushik Roy, and Claire Tomlin. "Probabilistic Estimation of State-Dependent Hybrid Mode Transitions for Aircraft Arrival Time Prediction." In AIAA Guidance, Navigation and Control Conference and Exhibit. American Institute of Aeronautics and Astronautics, 2007. http://dx.doi.org/10.2514/6.2007-6695.

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

Sarlin, Peter, Zhiyuan Yao, and Tomas Eklund. "Probabilistic Modeling of State Transitions on the Self-Organizing Map: Some Temporal Financial Applications." In 2012 45th Hawaii International Conference on System Sciences (HICSS). IEEE, 2012. http://dx.doi.org/10.1109/hicss.2012.486.

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

Wang, Xiaoyue, Xianwen Fang, and Ruihao Cao. "Mining the Model with the Hidden Transitions Based on Petri Net Probabilistic Behavioral Relations." In 3rd International Conference on Material, Mechanical and Manufacturing Engineering (IC3ME 2015). Atlantis Press, 2015. http://dx.doi.org/10.2991/ic3me-15.2015.162.

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

Fraga Pereira, Ramon, Mor Vered, Felipe Meneguzzi, and Miquel Ramírez. "Online Probabilistic Goal Recognition over Nominal Models." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/770.

Full text
Abstract:
This paper revisits probabilistic, model-based goal recognition to study the implications of the use of nominal models to estimate the posterior probability distribution over a finite set of hypothetical goals. Existing model-based approaches rely on expert knowledge to produce symbolic descriptions of the dynamic constraints domain objects are subject to, and these are assumed to produce correct predictions. We abandon this assumption to consider the use of nominal models that are learnt from observations on transitions of systems with unknown dynamics. Leveraging existing work on the acquisition of domain models via learning for Hybrid Planning we adapt and evaluate existing goal recognition approaches to analyze how prediction errors, inherent to system dynamics identification and model learning techniques have an impact over recognition error rates.
APA, Harvard, Vancouver, ISO, and other styles
9

Rochon, Chris, and David Finnicum. "POS Definition and Transition Risk Modeling Guidance." In ASME 2007 Power Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/power2007-22081.

Full text
Abstract:
Under the auspices of the Standards Developing Organizations (SDOs), the nuclear industry is currently in the process of developing standards for Probabilistic Risk Assessments (PRAs) to support risk-informed applications of nuclear power plants, including PRA standards for Low Power and Shutdown (LP/SD) operations. A particularly challenging part of building a LP/SD PRA model is the definition of quasi-steady Plant Operating States (POSs). This document provides guidance for developing the POSs needed for the creation and use of a LP/SD risk model based on a standard set of 15 generally applicable POSs. NUREG/CR-6144, prepared by the Brookhaven National Laboratory for the Nuclear Regulatory Commission (NRC) (for the Surry plant), was used as a foundation to build the set of standard set of 15 POSs presented here. Within these standard POSs, there is room for modification for plant- and application-specific purposes such as the specific LP/SD risk application of transition risk analysis. Specifically, modifications are accomplished by subdividing POSs. Another particularly challenging part of building a LP/SD PRA model is defining and modeling periods of transition which for the suggested guidance, are defined as risk-significant activities between quasi-steady POSs which involve significant configuration changes. This guidance provides support for developing the models needed for the evaluation of the risk associated with plant transitions occurring in the process of the plant shutdown and startup. Specifically, guidance is provided to lead a PRA modeler through the identification and characterization of the transitions and the selection and generation of appropriate transition PRA modeling elements and data. The transition modeling guidelines are applicable for procedure-based transitions (as opposed to physical-phenomenon-type transitions such as the drop in decay heat level) occurring during LP/SD operations. The guidance presented is intended to be applicable for all Light-Water Reactors (LWRs). The detailed guidance processes described are currently focused on Pressurized-Water Reactors (PWRs).
APA, Harvard, Vancouver, ISO, and other styles
10

Caleiro, Carlos, Filipe Casal, and Andreia Mordido. "Classical Generalized Probabilistic Satisfiability." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/126.

Full text
Abstract:
We analyze a classical generalized probabilistic satisfiability problem (GGenPSAT) which consists in deciding the satisfiability of Boolean combinations of linear inequalities involving probabilities of classical propositional formulas. GGenPSAT coincides precisely with the satisfiability problem of the probabilistic logic of Fagin et al. and was proved to be NP-complete. Here, we present a polynomial reduction of GGenPSAT to SMT over the quantifier-free theory of linear integer and real arithmetic. Capitalizing on this translation, we implement and test a solver for the GGenPSAT problem. As previously observed for many other NP-complete problems, we are able to detect a phase transition behavior for GGenPSAT.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "OR with probabilistic transitions"

1

Utsugi, Akio, and Motoyuki Akamatsu. Analysis of Car-Following Behavior Using Dynamic Probabilistic Models~Identification of Driving Mode Transition Using Dynamic Bayesian Networks. SAE International, 2005. http://dx.doi.org/10.4271/2005-08-0241.

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

Fu, Gongkang. Evaluation of Illinois Bridge Deterioration Models. Illinois Center for Transportation, 2021. http://dx.doi.org/10.36501/0197-9191/21-029.

Full text
Abstract:
The National Bridge Inventory bridge inspection system ranks the condition of bridge components on a scale of zero to nine. The resulting condition ratings represent an important element considered in deciding measures for bridge maintenance, repair, and rehabilitation. Thus, forecasting future condition ratings well is critical to reliable planning for these activities and estimating the costs. The Illinois Department of Transportation currently has deterministic models for this purpose. This study’s objective is to review the current models using condition rating histories gathered from 1980 to 2020 in Illinois for the following bridge components: deck, superstructure, substructure, culvert, and deck beam. The results show the current Illinois Department of Transportation models are inadequate in forecasting condition ratings, producing overestimates of the transition times between two condition rating levels for these components / systems, except for the deck beam, which is underestimated. It is recommended that the mean transition times found in this study from condition rating histories are used to replace the current models as a short-term solution. Further research is recommended to develop probabilistic models as a long-term solution to address observed significant variation or uncertainty in condition rating and transition times between condition rating levels.
APA, Harvard, Vancouver, ISO, and other styles
3

Kyburg Jr, Henry E. Probabilistic Inference and Probabilistic Reasoning. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada250602.

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

Barker, E. B., and A. L. Roginsky. Transitions :. National Institute of Standards and Technology, 2011. http://dx.doi.org/10.6028/nist.sp.800-131a.

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

Stones, Samuel, Jonathan Glazzard, Divya Jindal-Snape, Chris Murray, and Catriona Laird. School transitions: Whose transitions are they anyway? University of Dundee, 2020. http://dx.doi.org/10.20933/100001169.

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

Kyburg Jr, Henry E. Probabilistic Inference. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada255471.

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

Anderson, Gregory W. Electroweak phase transitions. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/10106114.

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

Plotkin, S. E. Examining hydrogen transitions. Office of Scientific and Technical Information (OSTI), 2007. http://dx.doi.org/10.2172/914962.

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

Anderson, G. W. Electroweak phase transitions. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/6049891.

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

Kolb, E. W. Cosmological phase transitions. Office of Scientific and Technical Information (OSTI), 1986. http://dx.doi.org/10.2172/5086987.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'OR with probabilistic transitions' for particular source types:
Journal articles Dissertations / Theses Books
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