Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Random Walk Algorithm). Showing records 1 – 12 of 12 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Bath

1. Gamlin, Samuel. Boundary conditions in Abelian sandpiles.

Degree: PhD, 2016, University of Bath

 The focus of this thesis is to investigate the impact of the boundary conditions on configurations in the Abelian sandpile model. We have two main… (more)

Subjects/Keywords: 512; Abelian sandpile; spanning forest; wilson's algorithm; Random walk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gamlin, S. (2016). Boundary conditions in Abelian sandpiles. (Doctoral Dissertation). University of Bath. Retrieved from https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687371

Chicago Manual of Style (16th Edition):

Gamlin, Samuel. “Boundary conditions in Abelian sandpiles.” 2016. Doctoral Dissertation, University of Bath. Accessed June 16, 2019. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687371.

MLA Handbook (7th Edition):

Gamlin, Samuel. “Boundary conditions in Abelian sandpiles.” 2016. Web. 16 Jun 2019.

Vancouver:

Gamlin S. Boundary conditions in Abelian sandpiles. [Internet] [Doctoral dissertation]. University of Bath; 2016. [cited 2019 Jun 16]. Available from: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687371.

Council of Science Editors:

Gamlin S. Boundary conditions in Abelian sandpiles. [Doctoral Dissertation]. University of Bath; 2016. Available from: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687371

2. Sebastian, Ahlberg. A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems.

Degree: Physics, 2014, Umeå University

The study of crowding effects on particle diffusion is a large subject with implications in many scientific areas. The studies span from pure theoretical… (more)

Subjects/Keywords: Molecular crowding; Gillespie's algorithm; Random walk; Nearly 1D-model; Particle diffusion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sebastian, A. (2014). A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92769

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sebastian, Ahlberg. “A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems.” 2014. Thesis, Umeå University. Accessed June 16, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92769.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sebastian, Ahlberg. “A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems.” 2014. Web. 16 Jun 2019.

Vancouver:

Sebastian A. A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems. [Internet] [Thesis]. Umeå University; 2014. [cited 2019 Jun 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92769.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sebastian A. A Monte Carlo study of the particle mobility in crowded nearly one-dimensional systems. [Thesis]. Umeå University; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92769

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Western Kentucky University

3. Mendis, Ruchini Dilinika. Sensitivity Analyses for Tumor Growth Models.

Degree: MS, Department of Mathematics, 2019, Western Kentucky University

  This study consists of the sensitivity analysis for two previously developed tumor growth models: Gompertz model and quotient model. The two models are considered… (more)

Subjects/Keywords: statistics; Random Walk Metropolis Algorithm; DRAM; Credible intervals; Applied Statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mendis, R. D. (2019). Sensitivity Analyses for Tumor Growth Models. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/3113

Chicago Manual of Style (16th Edition):

Mendis, Ruchini Dilinika. “Sensitivity Analyses for Tumor Growth Models.” 2019. Masters Thesis, Western Kentucky University. Accessed June 16, 2019. https://digitalcommons.wku.edu/theses/3113.

MLA Handbook (7th Edition):

Mendis, Ruchini Dilinika. “Sensitivity Analyses for Tumor Growth Models.” 2019. Web. 16 Jun 2019.

Vancouver:

Mendis RD. Sensitivity Analyses for Tumor Growth Models. [Internet] [Masters thesis]. Western Kentucky University; 2019. [cited 2019 Jun 16]. Available from: https://digitalcommons.wku.edu/theses/3113.

Council of Science Editors:

Mendis RD. Sensitivity Analyses for Tumor Growth Models. [Masters Thesis]. Western Kentucky University; 2019. Available from: https://digitalcommons.wku.edu/theses/3113


Indian Institute of Science

4. Rahaman, Md Aminoor. Search On A Hypercubic Lattice Using Quantum Random Walk.

Degree: 2009, Indian Institute of Science

Random walks describe diffusion processes, where movement at every time step is restricted only to neighbouring locations. Classical random walks are constructed using the non-relativistic… (more)

Subjects/Keywords: Lattice Theory - Data Processing; Quantum Random Walk; Grover's Algorithm; Dirac Operators; Quantum Computation; Dimensional Hypercubic Lattices; Random Walk Algorithm; Spatial Search; Quantum Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rahaman, M. A. (2009). Search On A Hypercubic Lattice Using Quantum Random Walk. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/972

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2009. Thesis, Indian Institute of Science. Accessed June 16, 2019. http://hdl.handle.net/2005/972.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2009. Web. 16 Jun 2019.

Vancouver:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/2005/972.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/972

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Touray, Barra. Energy-efficient routing algorithms for wireless sensor networks.

Degree: PhD, 2013, Liverpool John Moores University

 A wireless sensor network (WSN) is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of… (more)

Subjects/Keywords: 621.382; biased random walk, routing algorithm, clustering, energy efficient, shortest path first, wireless sensor network.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Touray, B. (2013). Energy-efficient routing algorithms for wireless sensor networks. (Doctoral Dissertation). Liverpool John Moores University. Retrieved from http://researchonline.ljmu.ac.uk/4352/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

Chicago Manual of Style (16th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Doctoral Dissertation, Liverpool John Moores University. Accessed June 16, 2019. http://researchonline.ljmu.ac.uk/4352/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

MLA Handbook (7th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Web. 16 Jun 2019.

Vancouver:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Internet] [Doctoral dissertation]. Liverpool John Moores University; 2013. [cited 2019 Jun 16]. Available from: http://researchonline.ljmu.ac.uk/4352/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

Council of Science Editors:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Doctoral Dissertation]. Liverpool John Moores University; 2013. Available from: http://researchonline.ljmu.ac.uk/4352/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282


Texas A&M University

6. Wang, Yijie. Module Identification for Biological Networks.

Degree: 2015, Texas A&M University

 Advances in high-throughput techniques have enabled researchers to produce large-scale data on molecular interactions. Systematic analysis of these large-scale interactome datasets based on their graph… (more)

Subjects/Keywords: Biological networks; Module identification for individual networks; Module identification for multiple networks; Block modeling; Degree heterogeneity; Non-negative matrix factorization; Two-hop Markov random walk; Sub-gradient Frank-Wolfe algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, Y. (2015). Module Identification for Biological Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155541

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Yijie. “Module Identification for Biological Networks.” 2015. Thesis, Texas A&M University. Accessed June 16, 2019. http://hdl.handle.net/1969.1/155541.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Yijie. “Module Identification for Biological Networks.” 2015. Web. 16 Jun 2019.

Vancouver:

Wang Y. Module Identification for Biological Networks. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/1969.1/155541.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Y. Module Identification for Biological Networks. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155541

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

7. Lalancette, Michaël. Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale .

Degree: 2017, Université de Montréal

 Nous présentons dans ce mémoire un nouvel algorithme de type Metropolis-Hastings dans lequel la distribution instrumentale a été conçue pour l'estimation de distributions cibles bimodales.… (more)

Subjects/Keywords: MCMC; Algorithme Metropolis de type marche aléatoire; Distribution bimodale; Convergence faible; Échelonnage optimal; Random walk Metropolis algorithm; Bimodal distribution; Weak convergence; Optimal scaling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lalancette, M. (2017). Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/19376

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lalancette, Michaël. “Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale .” 2017. Thesis, Université de Montréal. Accessed June 16, 2019. http://hdl.handle.net/1866/19376.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lalancette, Michaël. “Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale .” 2017. Web. 16 Jun 2019.

Vancouver:

Lalancette M. Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale . [Internet] [Thesis]. Université de Montréal; 2017. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/1866/19376.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lalancette M. Convergence d’un algorithme de type Metropolis pour une distribution cible bimodale . [Thesis]. Université de Montréal; 2017. Available from: http://hdl.handle.net/1866/19376

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

8. Mireuta, Matei. Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel .

Degree: 2012, Université de Montréal

 Les méthodes de Monte Carlo par chaîne de Markov (MCMC) sont des outils très populaires pour l’échantillonnage de lois de probabilité complexes et/ou en grandes… (more)

Subjects/Keywords: Échantillonneur indépendant; Algorithme Metropolis-Hastings de type marche aléatoire; Taux de convergence; Algorithme Metropolis adaptatif; Independent sampler; Random walk Metropolis-Hastings algorithms; Convergence rate; Adaptive Metropolis algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mireuta, M. (2012). Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/6231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mireuta, Matei. “Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel .” 2012. Thesis, Université de Montréal. Accessed June 16, 2019. http://hdl.handle.net/1866/6231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mireuta, Matei. “Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel .” 2012. Web. 16 Jun 2019.

Vancouver:

Mireuta M. Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel . [Internet] [Thesis]. Université de Montréal; 2012. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/1866/6231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mireuta M. Étude de la performance d’un algorithme Metropolis-Hastings avec ajustement directionnel . [Thesis]. Université de Montréal; 2012. Available from: http://hdl.handle.net/1866/6231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

9. Groiez, Assia. Recyclage des candidats dans l'algorithme Metropolis à essais multiples .

Degree: 2014, Université de Montréal

 Les méthodes de Monte Carlo par chaînes de Markov (MCCM) sont des méthodes servant à échantillonner à partir de distributions de probabilité. Ces techniques se… (more)

Subjects/Keywords: algorithme Metropolis-Hastings; marche aléatoire; échantillonneur indépendant; échantillonneur de Gibbs; algorithme à essais multiples; réversibilité; probabilité d’acceptation; Metropolis-Hastings algorithm; random walk; independent sampler; Gibbs sampler; multiple-try Metropolis algorithm; reversibility; acceptance probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Groiez, A. (2014). Recyclage des candidats dans l'algorithme Metropolis à essais multiples . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/10853

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Groiez, Assia. “Recyclage des candidats dans l'algorithme Metropolis à essais multiples .” 2014. Thesis, Université de Montréal. Accessed June 16, 2019. http://hdl.handle.net/1866/10853.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Groiez, Assia. “Recyclage des candidats dans l'algorithme Metropolis à essais multiples .” 2014. Web. 16 Jun 2019.

Vancouver:

Groiez A. Recyclage des candidats dans l'algorithme Metropolis à essais multiples . [Internet] [Thesis]. Université de Montréal; 2014. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/1866/10853.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Groiez A. Recyclage des candidats dans l'algorithme Metropolis à essais multiples . [Thesis]. Université de Montréal; 2014. Available from: http://hdl.handle.net/1866/10853

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Pajak, Dominik. Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé.

Degree: Docteur es, Informatique, 2014, Bordeaux

Nous étudions dans cette thèse le problème de l’exploration parallèle d’un graphe à l’aide des multiples, synchronisés et mobiles agents. Chaque agent est une entité… (more)

Subjects/Keywords: Exploration de graphes; Equipe d’agents mobiles; Algorithme; Marche déterministe; Rotor-router modèle; Marches aléatoires parallèles; Exploration collaborative; Algorithme d’apprentissage incrémental; Graph exploration; Team of agents; Algorithm; Deterministic walk; Rotor-routor model; Parallel random walks; Collaborative exploration; Online algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pajak, D. (2014). Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2014BORD0063

Chicago Manual of Style (16th Edition):

Pajak, Dominik. “Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé.” 2014. Doctoral Dissertation, Bordeaux. Accessed June 16, 2019. http://www.theses.fr/2014BORD0063.

MLA Handbook (7th Edition):

Pajak, Dominik. “Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé.” 2014. Web. 16 Jun 2019.

Vancouver:

Pajak D. Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2019 Jun 16]. Available from: http://www.theses.fr/2014BORD0063.

Council of Science Editors:

Pajak D. Algorithms for deterministic parallel graph exploration : Algorithmes pour l'exploration parallèle d'un graphe déterminé. [Doctoral Dissertation]. Bordeaux; 2014. Available from: http://www.theses.fr/2014BORD0063

11. Ung, Hervé. Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable.

Degree: Docteur es, Mathématiques appliquées et calcul scientifique, 2016, Bordeaux

Le but de cette thèse est de modéliser la propagation d’un contaminant au sein d’un réseau d’eau potable muni de capteurs temps réel. Elle comporte… (more)

Subjects/Keywords: Réseau d’eau potable; Identification des sources; Backtracking; CFD; Mélange imparfait; Double T; Dispersion; Marche aléatoire; SMaRT-OnlineWDN; Water distribution network; Source identification; Backtracking; CFD; Imperfect mixing; Double T-junction; Dispersion; Random walk; Monte Carlo; Greedy algorithm; SMaRT-OnlineWDN

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ung, H. (2016). Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2016BORD0015

Chicago Manual of Style (16th Edition):

Ung, Hervé. “Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable.” 2016. Doctoral Dissertation, Bordeaux. Accessed June 16, 2019. http://www.theses.fr/2016BORD0015.

MLA Handbook (7th Edition):

Ung, Hervé. “Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable.” 2016. Web. 16 Jun 2019.

Vancouver:

Ung H. Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable. [Internet] [Doctoral dissertation]. Bordeaux; 2016. [cited 2019 Jun 16]. Available from: http://www.theses.fr/2016BORD0015.

Council of Science Editors:

Ung H. Quasi real-time model for security of water distribution network : Modèle quasi-temps réel pour la sécurité des réseaux d’alimentation en eau potable. [Doctoral Dissertation]. Bordeaux; 2016. Available from: http://www.theses.fr/2016BORD0015


Université de Montréal

12. Gagnon, Philippe. Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles .

Degree: 2018, Université de Montréal

Subjects/Keywords: algorithme Metropolis de type marche aléatoire; analyse en composantes principales; distributions à ailes extrêmement relevées; inférence bayésienne; méthodes de Monte Carlo par chaînes de Markov; robustesse; valeurs aberrantes; Bayesian inference; Markov chain Monte Carlo methods; Outliers; Principal component analysis; Random walk Metropolis algorithm; Robustness; Super heavy-tailed distributions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gagnon, P. (2018). Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/20583

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gagnon, Philippe. “Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles .” 2018. Thesis, Université de Montréal. Accessed June 16, 2019. http://hdl.handle.net/1866/20583.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gagnon, Philippe. “Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles .” 2018. Web. 16 Jun 2019.

Vancouver:

Gagnon P. Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles . [Internet] [Thesis]. Université de Montréal; 2018. [cited 2019 Jun 16]. Available from: http://hdl.handle.net/1866/20583.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gagnon P. Sélection de modèles robuste : régression linéaire et algorithme à sauts réversibles . [Thesis]. Université de Montréal; 2018. Available from: http://hdl.handle.net/1866/20583

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.