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:(Message passing algorithms). Showing records 1 – 14 of 14 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Sack, Paul. Scalable collective message-passing algorithms.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

 Governments, universities, and companies expend vast resources building the top supercomputers. The processors and interconnect networks become faster, while the number of nodes grows exponentially.… (more)

Subjects/Keywords: Supercomputing; Message-passing; collective algorithms

algorithms 2.1 Introduction The Message Passing Interface Forum began developing the message… …message-passing, according to the authors. They present algorithms for the general MPI Comm… …interface for message-passing systems that includes support for pointto-point messaging… …communication algorithms. The three terms are α: the startup cost per message, which incorporates the… …3.16 Predicted and measured performance of bucket and 6-way bucket allgather algorithms… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sack, P. (2012). Scalable collective message-passing algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29839

Chicago Manual of Style (16th Edition):

Sack, Paul. “Scalable collective message-passing algorithms.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 26, 2019. http://hdl.handle.net/2142/29839.

MLA Handbook (7th Edition):

Sack, Paul. “Scalable collective message-passing algorithms.” 2012. Web. 26 Apr 2019.

Vancouver:

Sack P. Scalable collective message-passing algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/2142/29839.

Council of Science Editors:

Sack P. Scalable collective message-passing algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29839


University of Texas – Austin

2. Lee, Sang Hyun, 1977-. On a class of distributed algorithms over networks and graphs.

Degree: Electrical and Computer Engineering, 2011, University of Texas – Austin

 Distributed iterative algorithms are of great importance, as they are known to provide low-complexity and approximate solutions to what are otherwise high-dimensional intractable optimization problems.… (more)

Subjects/Keywords: Distributed algorithms; Graphical models; Belief propagation; Affinity propagation; Resource allocation; Genomic sequence analysis; Distributed iterative algorithms; Message-passing algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, Sang Hyun, 1. (2011). On a class of distributed algorithms over networks and graphs. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3093

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):

Lee, Sang Hyun, 1977-. “On a class of distributed algorithms over networks and graphs.” 2011. Thesis, University of Texas – Austin. Accessed April 26, 2019. http://hdl.handle.net/2152/ETD-UT-2011-05-3093.

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

MLA Handbook (7th Edition):

Lee, Sang Hyun, 1977-. “On a class of distributed algorithms over networks and graphs.” 2011. Web. 26 Apr 2019.

Vancouver:

Lee, Sang Hyun 1. On a class of distributed algorithms over networks and graphs. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3093.

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

Council of Science Editors:

Lee, Sang Hyun 1. On a class of distributed algorithms over networks and graphs. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3093

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


INP Toulouse

3. Partimbene, Vincent. Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions.

Degree: Docteur es, Mathematiques Appliquées, 2018, INP Toulouse

Cette thèse aborde la résolution des problèmes d'interaction fluide-structure par un algorithme consistant en un couplage entre deux solveurs : un pour le fluide et… (more)

Subjects/Keywords: Interaction fluide-structure; Multi-splitting; Volumes finis; Algorithmes parallèles; Message Passing Interface; Fluid-structure interaction; Multi-splitting; Finite volumes; Parallel algorithms; Message Passing Interface

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Partimbene, V. (2018). Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2018INPT0029

Chicago Manual of Style (16th Edition):

Partimbene, Vincent. “Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions.” 2018. Doctoral Dissertation, INP Toulouse. Accessed April 26, 2019. http://www.theses.fr/2018INPT0029.

MLA Handbook (7th Edition):

Partimbene, Vincent. “Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions.” 2018. Web. 26 Apr 2019.

Vancouver:

Partimbene V. Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions. [Internet] [Doctoral dissertation]. INP Toulouse; 2018. [cited 2019 Apr 26]. Available from: http://www.theses.fr/2018INPT0029.

Council of Science Editors:

Partimbene V. Calcul haute performance pour la simulation d'interactions fluide-structure : High performance computing for the simulation of fluid-structure interactions. [Doctoral Dissertation]. INP Toulouse; 2018. Available from: http://www.theses.fr/2018INPT0029


University of New South Wales

4. Elfeky, Ehab Zaky Mohammed Abdullah. Evolutionary Algorithms for Constrained Optimization.

Degree: Engineering & Information Technology, 2009, University of New South Wales

 Most real world optimization problems, and their corresponding models, are complex. This complexity arises from different sources, such as existence of the constraints, function characteristics,… (more)

Subjects/Keywords: Evolutionary Algorithms; Genetic Algorithms; Continuous Constrained Optimization; Cooperative Coevolution; Large-scale Optimization; Decomposition; Parallel Genetic Algorithms; Message Passing Interface; Scalable Test Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elfeky, E. Z. M. A. (2009). Evolutionary Algorithms for Constrained Optimization. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Elfeky, Ehab Zaky Mohammed Abdullah. “Evolutionary Algorithms for Constrained Optimization.” 2009. Doctoral Dissertation, University of New South Wales. Accessed April 26, 2019. http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true.

MLA Handbook (7th Edition):

Elfeky, Ehab Zaky Mohammed Abdullah. “Evolutionary Algorithms for Constrained Optimization.” 2009. Web. 26 Apr 2019.

Vancouver:

Elfeky EZMA. Evolutionary Algorithms for Constrained Optimization. [Internet] [Doctoral dissertation]. University of New South Wales; 2009. [cited 2019 Apr 26]. Available from: http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true.

Council of Science Editors:

Elfeky EZMA. Evolutionary Algorithms for Constrained Optimization. [Doctoral Dissertation]. University of New South Wales; 2009. Available from: http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true

5. Bonnin, David. Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes.

Degree: Docteur es, Informatique, 2015, Bordeaux; Bordeaux

En algorithmique distribuée, le modèle asynchrone par envoi de messages et à pannes est connu et utilisé dans de nombreux articles de par son réalisme,par… (more)

Subjects/Keywords: Algorithmes distribués; Asynchrone; Envoi de message; Panne; Mémoire partagée; Registre; Renommage; Diviseur; Distributed algorithms; Asynchronous; Message-passing; Crash; Shared memory; Register; Renaming; Splitter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bonnin, D. (2015). Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes. (Doctoral Dissertation). Bordeaux; Bordeaux. Retrieved from http://www.theses.fr/2015BORD0264

Chicago Manual of Style (16th Edition):

Bonnin, David. “Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes.” 2015. Doctoral Dissertation, Bordeaux; Bordeaux. Accessed April 26, 2019. http://www.theses.fr/2015BORD0264.

MLA Handbook (7th Edition):

Bonnin, David. “Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes.” 2015. Web. 26 Apr 2019.

Vancouver:

Bonnin D. Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes. [Internet] [Doctoral dissertation]. Bordeaux; Bordeaux; 2015. [cited 2019 Apr 26]. Available from: http://www.theses.fr/2015BORD0264.

Council of Science Editors:

Bonnin D. Algorithmique distribuée asynchrone avec une majorité de pannes : Asynchronous distributed computing with a majority of crashes. [Doctoral Dissertation]. Bordeaux; Bordeaux; 2015. Available from: http://www.theses.fr/2015BORD0264

6. Taftaf, Ala. Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing.

Degree: Docteur es, Mathématiques, 2017, Côte d'Azur

Le mode adjoint de la Différentiation Algorithmique (DA) est particulièrement intéressant pour le calcul des gradients. Cependant, ce mode utilise les valeurs intermédiaires de la… (more)

Subjects/Keywords: Différenciation algorithmique; Méthode adjointe; Algorithmes point-fixe; Communication par passage de message; MPI; Algorithmic differentiation; Adjoint methods; Fixed-point algorithms; Checkpointing; Message passing; MPI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Taftaf, A. (2017). Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing. (Doctoral Dissertation). Côte d'Azur. Retrieved from http://www.theses.fr/2017AZUR4001

Chicago Manual of Style (16th Edition):

Taftaf, Ala. “Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing.” 2017. Doctoral Dissertation, Côte d'Azur. Accessed April 26, 2019. http://www.theses.fr/2017AZUR4001.

MLA Handbook (7th Edition):

Taftaf, Ala. “Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing.” 2017. Web. 26 Apr 2019.

Vancouver:

Taftaf A. Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing. [Internet] [Doctoral dissertation]. Côte d'Azur; 2017. [cited 2019 Apr 26]. Available from: http://www.theses.fr/2017AZUR4001.

Council of Science Editors:

Taftaf A. Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul : Extensions of algorithmic differentiation by source transformation inspired by modern scientific computing. [Doctoral Dissertation]. Côte d'Azur; 2017. Available from: http://www.theses.fr/2017AZUR4001


Indian Institute of Science

7. Gupta, Rakhi. One To Mant And Many To Many Collective Communication Operations On Grids.

Degree: 2006, Indian Institute of Science

 Collective Communication Operations are widely used in MPI applications and play an important role in their performance. Hence, various projects have focused on optimization of… (more)

Subjects/Keywords: Collective Communication Operations; Grid System (Electrical Communication Engineering); Message Passing Interface; Grid Networks; Grids; MPI; Allgather - Algorithms; One-To-Many Collective Communication; Many-To-Many Collective Communication; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, R. (2006). One To Mant And Many To Many Collective Communication Operations On Grids. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/345

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):

Gupta, Rakhi. “One To Mant And Many To Many Collective Communication Operations On Grids.” 2006. Thesis, Indian Institute of Science. Accessed April 26, 2019. http://hdl.handle.net/2005/345.

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

MLA Handbook (7th Edition):

Gupta, Rakhi. “One To Mant And Many To Many Collective Communication Operations On Grids.” 2006. Web. 26 Apr 2019.

Vancouver:

Gupta R. One To Mant And Many To Many Collective Communication Operations On Grids. [Internet] [Thesis]. Indian Institute of Science; 2006. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/2005/345.

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

Council of Science Editors:

Gupta R. One To Mant And Many To Many Collective Communication Operations On Grids. [Thesis]. Indian Institute of Science; 2006. Available from: http://hdl.handle.net/2005/345

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

8. Abdelkafi, Omar. Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel.

Degree: Docteur es, Informatique, 2016, Mulhouse

De nombreux problèmes d'optimisation propres à différents secteurs industriels et académiques (énergie, chimie, transport, etc.) nécessitent de concevoir des méthodes de plus en plus efficaces… (more)

Subjects/Keywords: Métaheuristique; Hybridation; Algorithmes parallèles; Processeur graphique; MPI; TSP; Problème d'affectation quantique; Zéolithes; Metaphysics; Hybridization; Parallel algorithms; Graphics Processing Unit; Message Passing Interface; Quantum Assignment Problem; Zeolites

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abdelkafi, O. (2016). Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel. (Doctoral Dissertation). Mulhouse. Retrieved from http://www.theses.fr/2016MULH9578

Chicago Manual of Style (16th Edition):

Abdelkafi, Omar. “Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel.” 2016. Doctoral Dissertation, Mulhouse. Accessed April 26, 2019. http://www.theses.fr/2016MULH9578.

MLA Handbook (7th Edition):

Abdelkafi, Omar. “Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel.” 2016. Web. 26 Apr 2019.

Vancouver:

Abdelkafi O. Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel. [Internet] [Doctoral dissertation]. Mulhouse; 2016. [cited 2019 Apr 26]. Available from: http://www.theses.fr/2016MULH9578.

Council of Science Editors:

Abdelkafi O. Métaheuristiques hybrides distribuées et massivement parallèles : Hybrid metaheuristics distributed and massively parallel. [Doctoral Dissertation]. Mulhouse; 2016. Available from: http://www.theses.fr/2016MULH9578


Indian Institute of Science

9. Raveendran, Nithin. A Modified Sum-Product Algorithm over Graphs with Short Cycles.

Degree: 2015, Indian Institute of Science

 We investigate into the limitations of the sum-product algorithm for binary low density parity check (LDPC) codes having isolated short cycles. Independence assumption among messages… (more)

Subjects/Keywords: Computer Mathematics; Decoding Algorithms; Sum-Product Algorithms; Low Density Parity Check Codes (LDPC); Error Control Codes; Graphical Codes; Modified Message Passing Algorithm; Tanner Grpahs; Graph Algorithms; Cycle (Graph Theory); Short Cycle Graphs; Graphs; Iterative Decoding Algorithm; Electronic System Engineerin

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Raveendran, N. (2015). A Modified Sum-Product Algorithm over Graphs with Short Cycles. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf

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):

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2015. Thesis, Indian Institute of Science. Accessed April 26, 2019. http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf.

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

MLA Handbook (7th Edition):

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2015. Web. 26 Apr 2019.

Vancouver:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2019 Apr 26]. Available from: http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf.

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

Council of Science Editors:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Thesis]. Indian Institute of Science; 2015. Available from: http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf

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

10. NG KHAI SHENG. Contributions to the construction and decoding of non-binary low-density parity-check codes.

Degree: 2006, National University of Singapore

Subjects/Keywords: low-density parity-check (LDPC) codes; message passing algorithms; iterative decoding; mixed alphabet codes; integer residue rings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SHENG, N. K. (2006). Contributions to the construction and decoding of non-binary low-density parity-check codes. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/15432 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/2/bitstream

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):

SHENG, NG KHAI. “Contributions to the construction and decoding of non-binary low-density parity-check codes.” 2006. Thesis, National University of Singapore. Accessed April 26, 2019. http://scholarbank.nus.edu.sg/handle/10635/15432 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/2/bitstream.

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

MLA Handbook (7th Edition):

SHENG, NG KHAI. “Contributions to the construction and decoding of non-binary low-density parity-check codes.” 2006. Web. 26 Apr 2019.

Vancouver:

SHENG NK. Contributions to the construction and decoding of non-binary low-density parity-check codes. [Internet] [Thesis]. National University of Singapore; 2006. [cited 2019 Apr 26]. Available from: http://scholarbank.nus.edu.sg/handle/10635/15432 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/2/bitstream.

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

Council of Science Editors:

SHENG NK. Contributions to the construction and decoding of non-binary low-density parity-check codes. [Thesis]. National University of Singapore; 2006. Available from: http://scholarbank.nus.edu.sg/handle/10635/15432 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F15432/2/bitstream

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


University of Oxford

11. Kochems, Jonathan Antonius. Verification of asynchronous concurrency and the shaped stack constraint.

Degree: PhD, 2014, University of Oxford

 In this dissertation, we study the verification of concurrent programs written in the programming language Erlang using infinite-state model-checking. Erlang is a widely used, higher… (more)

Subjects/Keywords: 005.1; Computer science (mathematics); Computing; Theory and automated verification; Applications and algorithms; Concurrent Pushdown Systems; Asynchronous Message Passing; Verification; Infinite-State Model-Checking; Petri Nets; Well-Structured Transition Systems; Erlang; Infinite-State Systems Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kochems, J. A. (2014). Verification of asynchronous concurrency and the shaped stack constraint. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795

Chicago Manual of Style (16th Edition):

Kochems, Jonathan Antonius. “Verification of asynchronous concurrency and the shaped stack constraint.” 2014. Doctoral Dissertation, University of Oxford. Accessed April 26, 2019. http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795.

MLA Handbook (7th Edition):

Kochems, Jonathan Antonius. “Verification of asynchronous concurrency and the shaped stack constraint.” 2014. Web. 26 Apr 2019.

Vancouver:

Kochems JA. Verification of asynchronous concurrency and the shaped stack constraint. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Apr 26]. Available from: http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795.

Council of Science Editors:

Kochems JA. Verification of asynchronous concurrency and the shaped stack constraint. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795

12. Noorshams, Nima. Low-Complexity Message-Passing Algorithms for Distributed Computation.

Degree: Electrical Engineering & Computer Sciences, 2013, University of California – Berkeley

 Central to many statistical inference problems is the computation ofsome quantities defined over variables that can be fruitfully modeledin terms of graphs. Examples of such… (more)

Subjects/Keywords: Electrical engineering; Computer science; Statistics; belief propagation; distributed computation; gossip algorithms; low-complexity inference; message-passing; stochastic algorithms

passing algorithms . . Specification of the SBP algorithm . . . . . . . . . . . . . SBP error vs… …propagation is an iterative algorithm consisting of a set of local message-passing rounds that… …message-passing (SOSMP), an efficient message-passing algorithm for continuous state… …order to formally introduce the message-passing updates, we first need to define the notion of… …Figure 2.1. To provide some intuition regarding the message-passing algorithm, we proceed with… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Noorshams, N. (2013). Low-Complexity Message-Passing Algorithms for Distributed Computation. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7jw84172

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):

Noorshams, Nima. “Low-Complexity Message-Passing Algorithms for Distributed Computation.” 2013. Thesis, University of California – Berkeley. Accessed April 26, 2019. http://www.escholarship.org/uc/item/7jw84172.

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

MLA Handbook (7th Edition):

Noorshams, Nima. “Low-Complexity Message-Passing Algorithms for Distributed Computation.” 2013. Web. 26 Apr 2019.

Vancouver:

Noorshams N. Low-Complexity Message-Passing Algorithms for Distributed Computation. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Apr 26]. Available from: http://www.escholarship.org/uc/item/7jw84172.

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

Council of Science Editors:

Noorshams N. Low-Complexity Message-Passing Algorithms for Distributed Computation. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/7jw84172

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

13. Maddula, Sabaresh Nageswara Rao. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.

Degree: MSin Computer Science, Computer Science, 2012, University of Nevada – Las Vegas

  In this thesis, we give message passing algorithms in distributed environment for five different problems of a rooted tree having n nodes. In the… (more)

Subjects/Keywords: Computer algorithms; Message passing; Parallel computers; Routing (Computer network management); Computer Sciences; OS and Networks; Theory and Algorithms

…37 viii CHAPTER 1 INTRODUCTION In this thesis we give message passing algorithms in… …distributed systems. Later in the second section, we will discuss about the message passing system… …processors; Message Passing and Shared Memory. Shared memory systems are those in which there is a… …shared data variables and control variables. In Message passing systems, the processors… …Passing System Here we will present a brief overview of message passing interface in distributed… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maddula, S. N. R. (2012). Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/1683

Chicago Manual of Style (16th Edition):

Maddula, Sabaresh Nageswara Rao. “Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.” 2012. Masters Thesis, University of Nevada – Las Vegas. Accessed April 26, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/1683.

MLA Handbook (7th Edition):

Maddula, Sabaresh Nageswara Rao. “Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.” 2012. Web. 26 Apr 2019.

Vancouver:

Maddula SNR. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2012. [cited 2019 Apr 26]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1683.

Council of Science Editors:

Maddula SNR. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. [Masters Thesis]. University of Nevada – Las Vegas; 2012. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1683

14. Saade, Alaa. Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications.

Degree: Docteur es, Physique théorique, 2016, Paris Sciences et Lettres

Face au déluge actuel de données principalement non structurées, les graphes ont démontré, dans une variété de domaines scientifiques, leur importance croissante comme language abstrait… (more)

Subjects/Keywords: Opérateur non retraçant; Hessienne de Bethe; Méthodes spectrales; Détection de communautés; Partitionnement spectral; Complétion de matrices; Modèles graphiques; Inférence bayésienne; Approximations de champ moyen; Systèmes désordonnés; Propagation des convictions; Algorithmes de passage de messages; Non-backtracking operator; Bethe Hessian; Spectral methods; Community detection; Spectral clustering; Matrix completion; Graphical models; Bayesian inference; Meanfield approximations; Disordered systems; Belief propagation; Message-passing algorithms; 530

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saade, A. (2016). Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2016PSLEE024

Chicago Manual of Style (16th Edition):

Saade, Alaa. “Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications.” 2016. Doctoral Dissertation, Paris Sciences et Lettres. Accessed April 26, 2019. http://www.theses.fr/2016PSLEE024.

MLA Handbook (7th Edition):

Saade, Alaa. “Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications.” 2016. Web. 26 Apr 2019.

Vancouver:

Saade A. Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2016. [cited 2019 Apr 26]. Available from: http://www.theses.fr/2016PSLEE024.

Council of Science Editors:

Saade A. Spectral inference methods on sparse graphs : theory and applications : Méthodes spectrales d'inférence sur des graphes parcimonieux : théorie et applications. [Doctoral Dissertation]. Paris Sciences et Lettres; 2016. Available from: http://www.theses.fr/2016PSLEE024

.