Relevant bibliographies by topics / Probabilité discrète

Contents

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

Academic literature on the topic 'Probabilité discrète'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 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 'Probabilité discrète.'

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 "Probabilité discrète"

1

Embrechts, Paul, and Hugh I. Gordon. "Discrete Probability." Journal of the American Statistical Association 93, no. 443 (1998): 1243. http://dx.doi.org/10.2307/2669882.

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

PD, David Aldous, and James Propp. "Microsurveys in Discrete Probability." Journal of the American Statistical Association 94, no. 447 (1999): 989. http://dx.doi.org/10.2307/2670027.

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

Krapavitskaite, D. "Discrete semistable probability distributions." Journal of Soviet Mathematics 38, no. 5 (1987): 2309–19. http://dx.doi.org/10.1007/bf01093832.

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

Zhou, Shizhong, Liwei Liu, and Jianjun Li. "A Discrete-Time Queue with Preferred Customers and Partial Buffer Sharing." Mathematical Problems in Engineering 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/173938.

Full text
Abstract:
We analyze a discrete-time Geo/Geo/1 queueing system with preferred customers and partial buffer sharing. In this model, customers arrive according to geometrical arrival processes with probabilityλ. If an arriving customer finds the server idle, he begins instantly his services. Otherwise, if the server is busy at the arrival epoch, the arrival either interrupts the customer being served to commence his own service with probabilityθ(the customer is called the preferred customer) or joins the waiting line at the back of the queue with probabilityθ~(the customer is called the normal customer) if permitted. The interrupted customer joins the waiting line at the head of the queue. If the total number of customers in the system is equal to or more than thresholdN, the normal customer will be ignored to enter into the system. But this restriction is not suitable for the preferred customers; that is, this system never loses preferred customers. A necessary and sufficient condition for the system to be stable is investigated and the stationary distribution of the queue length of the system is also obtained. Further, we develop a novel method to solve the probability generating function of the busy period of the system. The distribution of sojourn time of a customer in the server and the other indexes are acquired as well.
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Bill Huajian. "Monotonic Estimation for the Survival Probability over a Risk-Rated Portfolio by Discrete-Time Hazard Rate Models." International Journal of Machine Learning and Computing 9, no. 5 (2019): 675–81. http://dx.doi.org/10.18178/ijmlc.2019.9.5.857.

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

LENCZEWSKI, ROMUALD, and RAFAŁ SAŁAPATA. "DISCRETE INTERPOLATION BETWEEN MONOTONE PROBABILITY AND FREE PROBABILITY." Infinite Dimensional Analysis, Quantum Probability and Related Topics 09, no. 01 (2006): 77–106. http://dx.doi.org/10.1142/s021902570600224x.

Full text
Abstract:
We construct a sequence of states called m-monotone product states which give a discrete interpolation between the monotone product of states of Muraki in monotone probability and the free product of states of Avitzour and Voiculescu in free probability. We derive the associated basic limit theorems and develop the combinatorics based on non-crossing ordered partitions with monotone order starting from depth m. We deduce an explicit formula for the Cauchy transforms of the m-monotone central limit measures and for the associated Jacobi coefficients. A new type of combinatorics of inner blocks in non-crossing partitions leads to explicit formulas for the mixed moments of m-monotone Gaussian operators, which are new even in the case of monotone independent Gaussian operators with arcsine distributions.
APA, Harvard, Vancouver, ISO, and other styles
7

Ivanov, V. A., G. I. Ivchenko, and Yu I. Medvedev. "Discrete problems in probability theory." Journal of Soviet Mathematics 31, no. 2 (1985): 2759–95. http://dx.doi.org/10.1007/bf02116601.

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

Tuden, Ivana Geček. "Ruin probability for discrete risk processes." Studia Scientiarum Mathematicarum Hungarica 56, no. 4 (2019): 420–39. http://dx.doi.org/10.1556/012.2019.56.4.1441.

Full text
Abstract:
Abstract We study the discrete time risk process modelled by the skip-free random walk and derive results connected to the ruin probability and crossing a fixed level for this type of process. We use the method relying on the classical ballot theorems to derive the results for crossing a fixed level and compare them to the results known for the continuous time version of the risk process. We generalize this model by adding a perturbation and, still relying on the skip-free structure of that process, we generalize the previous results on crossing the fixed level for the generalized discrete time risk process. We further derive the famous Pollaczek-Khinchine type formula for this generalized process, using the decomposition of the supremum of the dual process at some special instants of time.
APA, Harvard, Vancouver, ISO, and other styles
9

Quine, M. P. "PROBABILITY APPROXIMATIONS FOR DIVISIBLE DISCRETE DISTRIBUTIONS." Australian Journal of Statistics 36, no. 3 (1994): 339–49. http://dx.doi.org/10.1111/j.1467-842x.1994.tb00886.x.

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

Kupershmidt, Boris A. "q-Probability: I. Basic Discrete Distributions." Journal of Nonlinear Mathematical Physics 7, no. 1 (2000): 73–93. http://dx.doi.org/10.2991/jnmp.2000.7.1.6.

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

Dissertations / Theses on the topic "Probabilité discrète"

1

Le, cousin Jean-Maxime. "Asymptotique des feux rares dans le modèle des feux de forêts." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1018/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à deux modèles de feux de forêts définis sur Z. On étudie le modèle des feux de forêts sur Z avec propagation non instantanée dans le chapitre 2. Dans ce modèle, chaque site a trois états possibles : vide, occupé ou en feu. Un site vide devient occupé avec taux 1. Sur chaque site, des allumettes tombent avec taux λ. Si le site est occupé, il brûle pendant un temps exponentiel de paramètre π avant de se propager à ses deux voisins. S’ils sont eux-mêmes occupés, ils brûlent, sinon le feu s’éteint. On étudie l’asymptotique des feux rares c’est à dire la limite du processus lorsque λ → 0 et π → ∞. On montre qu’il y a trois catégories possibles de limites d’échelles, selon le régime dans lequel λ tend vers 0 et π vers l’infini. On étudie formellement et brièvement dans le chapitre 3 le modèle des feux de forêts sur Z en environnement aléatoire. Dans ce modèle, chaque site n’a que deux états possibles : vide ou occupé. On se donne un paramètre λ &gt; 0, une loi ν sur (0 ,∞) et une suite (κi)i∈Z de variables aléatoires indépendantes identiquement distribuées selon ν. Un site vide i devient occupé avec taux κi. Sur chaque site, des allumettes tombent avec taux λ et détruisent immédiatement la composante de sites occupés correspondante. On étudie l’asymptotique des feux rares. Sous une hypothèse raisonnable sur ν, on espère que le processus converge, avec une renormalisation correcte, vers un modèle limite. On s’attend à distinguer trois processus limites différents<br>The aim of this work is to study two differents forest-fire processes defined on Z. In Chapter 2, we study the so-called one dimensional forest-fire process with non instantaeous propagation. In this model, each site has three possible states: ’vacant’, ’occupied’ or ’burning’. Vacant sites become occupied at rate 1. At each site, ignition (by lightning) occurs at rate λ. When a site is ignited, a fire starts and propagates to neighbors at rate π. We study the asymptotic behavior of this process as λ → 0 and π → ∞. We show that there are three possible classes of scaling limits, according to the regime in which λ → 0 and π → ∞. In Chapter 3, we study formally and briefly the so-called one dimensional forest-fire processes in random media. Here, each site has only two possible states: ’vacant’ or occupied’. Consider a parameter λ &gt; 0, a probability distribution ν on (0 ,∞) as well as (κi)i∈Z an i.i.d. sequence of random variables with law ν. A vacant site i becomes occupied at rate κi. At each site, ignition (by lightning) occurs at rate λ. When a site is ignited, the fire destroys the corresponding component of occupied sites. We study the asymptotic behavior of this process as λ → 0. Under some quite reasonable assumptions on the law ν, we hope that the process converges, with a correct normalization, to a limit forest fire model. We expect that there are three possible classes of scaling limits
APA, Harvard, Vancouver, ISO, and other styles
2

Laurent, Stéphane. "Filtrations à temps discret négatif." Université Louis Pasteur (Strasbourg) (1971-2008), 2004. https://publication-theses.unistra.fr/public/theses_doctorat/2004/LAURENT_Stephane_2004.pdf.

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

Hachemi, Aïcha. "Analyse Dynamique d'Algorithmes Euclidiens et Théorèmes Limites." Phd thesis, Université Paris-Diderot - Paris VII, 2007. http://tel.archives-ouvertes.fr/tel-00343537.

Full text
Abstract:
Dans cette thèse, nous nous intéressons au comportement asymptotique des distributions de coûts associés à des algorithmes d'Euclide de la classe rapide. Nous commençons dans un premier chapitre par des rappels sur les propriétés dynamiques des systèmes euclidiens et introduisons la propriété de moments forts pour les coûts additifs non-réseau. Nous établissons ensuite la condition de coût fortement diophantien et montrons sa généricité. Dans le deuxième chapitre, nous analysons, en adaptant des techniques de Dolgopyat-Melbourne, des perturbations d'opérateurs de transfert associés à des applications de la bonne classe. Ces résultats sont utilisés dans le troisième chapitre pour obtenir des estimations sur la fonction génératrice des moments où nous montrons sa quasi-décroissance exponentielle. <br /><br />Le dernier chapitre est consacré aux démonstrations de téorèmes de la limite locale. Le premier théorème est sans vitesse de convergence et concerne tous les coùts non-réseau ayant des moments forts à l'ordre trois. La condition diphantienne nous permet ensuite d'établir un théorème de la limite locale avec contrôle de la vitesse de convergence. Pour des observables suffisament régulières, nous obtenons une vitesse de convergence optimale.
APA, Harvard, Vancouver, ISO, and other styles
4

Skipper, Max. "Some approximation theorems in discrete probability." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526439.

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

Hansen, Mary Jo. "Probability of Discrete Failures, Weibull Distribution." DigitalCommons@USU, 1989. https://digitalcommons.usu.edu/etd/7023.

Full text
Abstract:
The intent of this research and these is to describe the development of a series of charts and tables that provide the individual and cumulative probabilities of failure applying to the Weibull statistical distribution. The mathematical relationships are developed and the computer programs are described for deterministic and Monte Carlo models that compute and verify the results. Charts and tables reflecting the probabilities of failure for a selected set of parameters of the Weibull distribution functions are provided.
APA, Harvard, Vancouver, ISO, and other styles
6

Hutchcroft, Thomas. "Discrete probability and the geometry of graphs." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/62595.

Full text
Abstract:
We prove several theorems concerning random walks, harmonic functions, percolation, uniform spanning forests, and circle packing, often in combination with each other. We study these models primarily on planar graphs, on transitive graphs, and on unimodular random rooted graphs, although some of our results hold for more general classes of graphs. Broadly speaking, we are interested in the interplay between the geometry of a graph and the behaviour of probabilistic processes on that graph. Material taken from a total of nine papers is included. We have also included an extended introduction explaining the background and context to these papers.<br>Science, Faculty of<br>Mathematics, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles
7

Scorbureanu, Alexandrina-Ioana. "Discrete choice models applied to travel demand analysis : focus on risk and heterogeneity." Thesis, Cachan, Ecole normale supérieure, 2012. http://www.theses.fr/2012DENS0044.

Full text
Abstract:
La thèse se propose d'intégrer deux approches économiques fondamentales à l'étude de l'économie régionale et de la politique économique des transports en particulier: i) un approche théorique, fondée sur des micromodèles analytiques et soutenue par des applications des méthodes de simulation numérique, et ensuite, ii) un approche empirique pour tester des hypothèses théorétiques. La perspective de microéconomie sur les problématiques et le fonctionnement des mécanismes des transports privés sont, au même temps, nécessaires et ardues à modéliser. Parmi les nombreuses problématiques étudiés dans le cadre de cet domaine de recherche il vaut la peine de mentionner: la taxation des routes, la concurrence parfaite et oligopolistique entre les opérateurs que anime le système des transports privées et de marchandises, la congestion des routes et le comportement des usagers face à l'incertitude relative aux temps de trajet où encore, le processus de décision en matière de transports au sein des ménages. L'approche micro-fondée liée aux problématiques ci-dessus a été intégrée au sein de cet étude avec une vision empirique, menée à l'analyse de l'ensemble des politiques de plani cation au niveau régional et urbain. Les deux applications empiriques présentées montrent deux nouvelles méthodologies d'étude concernant deux problématiques classiques: i) le choix modale, dans une optique de décision conjointe observée sur un échantillon des couples résidents en Ile-de-France et, ii) le choix de route en Moyen Orient, où les temps de trajet sont incertains et dépends d'un scenario politique incertain au niveau macroéconomique. L'intégration des deux approches est réalisée dans le cadre de cette thèse ayant comme exigence celle de mieux répondre aux questions concrètes et actuelles de la recherche européenne, ainsi que pour augmenter la palette des débouchées applicatives des modèles théoriques développées dans la littérature récente<br>This thesis aims to integrate two fundamental approaches to the study of regional economics and the transport policy: i) a theoretical approach based on analytic models supported by numerical simulation and ii) an empirical approach to test theoretical assumptions. The microeconomic perspective represents a challenging and a complex task at the same time. Some of the open issues at the center of debate are: the taxation of roads, perfect and imperfect competition among the networks supporting private trips, congestion pricing and the attitude towards risky outcomes as uncertain travel times, the decision making process and resource sharing among different members of a household. The micro approach has been integrated with two empirical experiments in which we propose new approaches to study two traditional problems: i) modal choice, by testing the jointness of decision making on a sample of active couples from Ile-de-France, and ii) route choice in the Middle East - a context in which the travel time, as an input of the decision process, is characterized by uncertainty and depends on the political scenario at the macro level
APA, Harvard, Vancouver, ISO, and other styles
8

Laslier, Benoît. "Dynamique stochastique d'interface discrète et modèles de dimères." Phd thesis, Université Claude Bernard - Lyon I, 2014. http://tel.archives-ouvertes.fr/tel-01044463.

Full text
Abstract:
Nous avons étudié la dynamique de Glauber sur les pavages de domaines finies du plan par des losanges ou par des dominos de taille 2 × 1. Ces pavages sont naturellement associés à des surfaces de R^3, qui peuvent être vues comme des interfaces dans des modèles de physique statistique. En particulier les pavages par des losanges correspondent au modèle d'Ising tridimensionnel à température nulle. Plus précisément les pavages d'un domaine sont en bijection avec les configurations d'Ising vérifiant certaines conditions au bord (dépendant du domaine pavé). Ces conditions forcent la coexistence des phases + et - ainsi que la position du bord de l'interface. Dans la limite thermodynamique où L, la longueur caractéristique du système, tend vers l'infini, ces interfaces obéissent à une loi des grand nombre et convergent vers une forme limite déterministe ne dépendant que des conditions aux bord. Dans le cas où la forme limite est planaire et pour les losanges, Caputo, Martinelli et Toninelli [CMT12] ont montré que le temps de mélange Tmix de la dynamique est d'ordre O(L^{2+o(1)}) (scaling diffusif). Nous avons généralisé ce résultat aux pavages par des dominos, toujours dans le cas d'une forme limite planaire. Nous avons aussi prouvé une borne inférieure Tmix ≥ cL^2 qui améliore d'un facteur log le résultat de [CMT12]. Dans le cas où la forme limite n'est pas planaire, elle peut être analytique ou bien contenir des parties "gelées" où elle est en un sens dégénérée. Dans le cas où elle n'a pas de telle partie gelée, et pour les pavages par des losanges, nous avons montré que la dynamique de Glauber devient "macroscopiquement proche" de l'équilibre en un temps L^{2+o(1)}
APA, Harvard, Vancouver, ISO, and other styles
9

De, Félice Sven. "Automates codéterministes et automates acycliques : analyse d'algorithmes et génération aléatoire." Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1111/document.

Full text
Abstract:
Le cadre générale de cette thèse est l'analyse quantitative des objets issus de la théorie des langages rationnels. On adapte des techniques d'analyse d'algorithmes (complexité en moyenne, complexité générique, génération aléatoire, ...) à des objets et à des algorithmes qui font intervenir des classes particulières d'automates. Dans une première partie nous étudions la complexité de l'algorithme de minimisation de Brzozowski. Bien qu'ayant une mauvaise complexité dans le pire des cas, cet algorithme a la réputation d'être efficace en pratique. En utilisant les propriétés typiques des applications et des permutations aléatoires, nous montrons que la complexité générique de l'algorithme de Brzozowski appliqué à un automate déterministe croît plus vite que tout polynôme en n, où n est le nombre d'états de l'automate. Dans une seconde partie nous nous intéressons à la génération aléatoire d'automates acycliques. Ces automates sont ceux qui reconnaissent les ensembles finis de mots et sont de ce fait utilisés dans de nombreuses applications, notamment en traitement automatique des langues. Nous proposons deux générateurs aléatoires. Le premier utilise le modèle des chaînes de Markov, et le second utilise la "méthode récursive", qui tire partie des décompositions combinatoires des objets pour faire de la génération. La première méthode est souple mais difficile à calibrer, la seconde s'avère plutôt efficace. Une fois implantée, cette dernière nous a notamment permis d'observer les propriétés typiques des grands automates acycliques aléatoires<br>The general context of this thesis is the quantitative analysis of objects coming from rational language theory. We adapt techniques from the field of analysis of algorithms (average-case complexity, generic complexity, random generation...) to objects and algorithms that involve particular classes of automata. In a first part we study the complexity of Brzozowski's minimisation algorithm. Although the worst-case complexity of this algorithm is bad, it is known to be efficient in practice. Using typical properties of random mappings and random permutations, we show that the generic complexityof Brzozowski's algorithm grows faster than any polynomial in n, where n is the number of states of the automaton. In a second part, we study the random generation of acyclic automata. These automata recognize the finite sets of words, and for this reason they are widely use in applications, especially in natural language processing. We present two random generators, one using a model of Markov chain, the other a ``recursive method", based on a cominatorics decomposition of structures. The first method can be applied in many situations cases but is very difficult to calibrate, the second method is more efficient. Once implemented, this second method allows to observe typical properties of acyclic automata of large size
APA, Harvard, Vancouver, ISO, and other styles
10

Gaumer, Madelyn. "Using Neural Networks to Classify Discrete Circular Probability Distributions." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/hmc_theses/226.

Full text
Abstract:
Given the rise in the application of neural networks to all sorts of interesting problems, it seems natural to apply them to statistical tests. This senior thesis studies whether neural networks built to classify discrete circular probability distributions can outperform a class of well-known statistical tests for uniformity for discrete circular data that includes the Rayleigh Test1, the Watson Test2, and the Ajne Test3. Each neural network used is relatively small with no more than 3 layers: an input layer taking in discrete data sets on a circle, a hidden layer, and an output layer outputting probability values between 0 and 1, with 0 mapping to uniform and 1 mapping to nonuniform. In evaluating performances, I compare the accuracy, type I error, and type II error of this class of statistical tests and of the neural networks built to compete with them. 1 Jammalamadaka, S. Rao(1-UCSB-PB); SenGupta, A.(6-ISI-ASU)Topics in circular statistics. (English summary) With 1 IBM-PC floppy disk (3.5 inch; HD). Series on Multivariate Analysis, 5. World Scientific Publishing Co., Inc., River Edge, NJ, 2001. xii+322 pp. ISBN: 981-02-3778-2 2 Watson, G. S.Goodness-of-fit tests on a circle. II. Biometrika 49 1962 57–63. 3 Ajne, B.A simple test for uniformity of a circular distribution. Biometrika 55 1968 343–354.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Probabilité discrète"

1

Johnson, Norman Lloyd. Univariate discrete distributions. 2nd ed. Wiley, 1992.

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

W, Kemp Adrienne, and Kotz Samuel, eds. Univariate discrete distributions. 3rd ed. Wiley, 2005.

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

Hugh, Gordon. Discrete probability. Springer, 1997.

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

Gordon, Hugh. Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8.

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

Alon, Noga. The probabilistic method. 3rd ed. John Wiley, 2008.

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

Alon, Noga. The probabilistic method. 3rd ed. John Wiley, 2008.

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

Alon, Noga. The probabilistic method. 2nd ed. Wiley, 2000.

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

Alon, Noga. The probabilistic method. Wiley, 1992.

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

H, Spencer Joel, ed. The probabilistic method. John Wiley & Sons, Inc., 2016.

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

Alon, Noga. The Probabilistic Method. John Wiley & Sons, Ltd., 2005.

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

Book chapters on the topic "Probabilité discrète"

1

Lovász, L., J. Pelikán, and K. Vesztergombi. "Combinatorial Probability." In Discrete Mathematics. Springer New York, 2003. http://dx.doi.org/10.1007/0-387-21777-0_5.

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

Spencer, Joel. "Discrete Probability." In Mathematics Unlimited — 2001 and Beyond. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56478-9_56.

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

Brémaud, Pierre. "Discrete Probability." In Undergraduate Texts in Mathematics. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-1046-7_2.

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

Roman, Steven. "Discrete Probability." In Undergraduate Texts in Mathematics. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3582-2_4.

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

Gordon, Hugh. "Introduction." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_1.

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

Gordon, Hugh. "Counting." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_2.

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

Gordon, Hugh. "Independence and Conditional Probability." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_3.

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

Gordon, Hugh. "Random Variables." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_4.

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

Gordon, Hugh. "More About Random Variables." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_5.

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

Gordon, Hugh. "Approximating Probabilities." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_6.

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

Conference papers on the topic "Probabilité discrète"

1

Tomatsu, Reiji. "Poisson boundaries of discrete quantum groups." In Noncommutative Harmonic Analysis with Applications to Probability II. Institute of Mathematics Polish Academy of Sciences, 2010. http://dx.doi.org/10.4064/bc89-0-20.

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

Sozzo, Sandro, Luigi Accardi, Guillaume Adenier, et al. "Discrete Generalized Observables and Ideal Measurements in the ESR Model: A Hilbert Space Representation." In FOUNDATIONS OF PROBABILITY AND PHYSICS—5. AIP, 2009. http://dx.doi.org/10.1063/1.3109967.

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

Strassen, Volker. "Probability, Algorithms and Complexity." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.62.

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

Smirnov, Stanislav. "Discrete Complex Analysis and Probability." In Proceedings of the International Congress of Mathematicians 2010 (ICM 2010). Published by Hindustan Book Agency (HBA), India. WSPC Distribute for All Markets Except in India, 2011. http://dx.doi.org/10.1142/9789814324359_0026.

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

Santiago Acosta, Rubén Darío, Ernesto Manuel Hernández Cooper, and Faustino Yescas Martinez. "INTERACTIVE SIMULATIONS OF DISCRETE PROBABILITY DISTRIBUTIONS." In 13th International Technology, Education and Development Conference. IATED, 2019. http://dx.doi.org/10.21125/inted.2019.2438.

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

Zhao, Sicheng, Hongxun Yao, Xiaolei Jiang, and Xiaoshuai Sun. "Predicting discrete probability distribution of image emotions." In 2015 IEEE International Conference on Image Processing (ICIP). IEEE, 2015. http://dx.doi.org/10.1109/icip.2015.7351244.

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

Mao, Jianfeng, and Christos G. Cassandras. "Solving a class of discrete event simulation-based optimization problems using “optimality in probability”." In 2016 13th International Workshop on Discrete Event Systems (WODES). IEEE, 2016. http://dx.doi.org/10.1109/wodes.2016.7497837.

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

Reznik, Yuriy A. "An Algorithm for Quantization of Discrete Probability Distributions." In 2011 Data Compression Conference (DCC). IEEE, 2011. http://dx.doi.org/10.1109/dcc.2011.40.

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

Kulkarni, Anand J., I. R. Kale, K. Tai, and S. Kazemzadeh Azad. "Discrete optimization of truss structure using Probability Collectives." In 2012 12th International Conference on Hybrid Intelligent Systems (HIS). IEEE, 2012. http://dx.doi.org/10.1109/his.2012.6421338.

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

Elsaesser, Derek. "The Discrete Probability Density Method for Emitter Geolocation." In 2006 Canadian Conference on Electrical and Computer Engineering. IEEE, 2006. http://dx.doi.org/10.1109/ccece.2006.277336.

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

Reports on the topic "Probabilité discrète"

1

Alzaid, A. A., C. R. Rao, and D. N. Shanbhag. Characterization of Discrete Probability Distributions by Partial Independence. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada160130.

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

Clausen, Jay, Susan Frankenstein, Jason Dorvee, et al. Spatial and temporal variance of soil and meteorological properties affecting sensor performance—Phase 2. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41780.

Full text
Abstract:
An approach to increasing sensor performance and detection reliability for buried objects is to better understand which physical processes are dominant under certain environmental conditions. The present effort (Phase 2) builds on our previously published prior effort (Phase 1), which examined methods of determining the probability of detection and false alarm rates using thermal infrared for buried-object detection. The study utilized a 3.05 × 3.05 m test plot in Hanover, New Hampshire. Unlike Phase 1, the current effort involved removing the soil from the test plot area, homogenizing the material, then reapplying it into eight discrete layers along with buried sensors and objects representing targets of inter-est. Each layer was compacted to a uniform density consistent with the background undisturbed density. Homogenization greatly reduced the microscale soil temperature variability, simplifying data analysis. The Phase 2 study spanned May–November 2018. Simultaneous measurements of soil temperature and moisture (as well as air temperature and humidity, cloud cover, and incoming solar radiation) were obtained daily and recorded at 15-minute intervals and coupled with thermal infrared and electro-optical image collection at 5-minute intervals.
APA, Harvard, Vancouver, ISO, and other styles
3

Bedoya-Maya, Felipe, Lynn Scholl, Orlando Sabogal-Cardona, and Daniel Oviedo. Who uses Transport Network Companies?: Characterization of Demand and its Relationship with Public Transit in Medellín. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003621.

Full text
Abstract:
Transport Network Companies (TNCs) have become a popular alternative for mobility due to their ability to provide on-demand flexible mobility services. By offering smartphone-based, ride-hailing services capable of satisfying specific travel needs, these modes have transformed urban mobility worldwide. However, to-date, few studies have examined the impacts in the Latin American context. This analysis is a critical first step in developing policies to promote efficient and sustainable transport systems in the Latin-American region. This research examines the factors affecting the adoption of on-demand ride services in Medellín, Colombia. It also explores whether these are substituting or competing with public transit. First, it provides a descriptive analysis in which we relate the usage of platform-based services with neighborhood characteristics, socioeconomic information of individuals and families, and trip-level details. Next, factors contributing to the election of platform-based services modeled using discrete choice models. The results show that wealthy and highly educated families with low vehicle availability are more likely to use TNCs compared to other groups in Medellín. Evidence also points at gender effects, with being female significantly increasing the probability of using a TNC service. Finally, we observe both transit complementary and substitution patterns of use, depending on the context and by whom the service is requested.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Probabilité discrète' 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