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:(Distributed algorithms). Showing records 1 – 30 of 384 total matches.

[1] [2] [3] [4] [5] … [13]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Indiana University

1. Firoz, Jesun Sahariar. Synchronization-avoiding graph algorithms and runtime aspects .

Degree: 2018, Indiana University

 Massively parallel computers provide unprecedented computing power that is only expected to grow. General-purpose Asynchronous Many-Task (AMT) runtimes exposes significant fine-grained parallelism. However, traditional Bulk-Synchronous… (more)

Subjects/Keywords: Distributed Graph Algorithms; Distributed Runtimes; Graph Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Firoz, J. S. (2018). Synchronization-avoiding graph algorithms and runtime aspects . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/22605

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

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Thesis, Indiana University. Accessed March 18, 2019. http://hdl.handle.net/2022/22605.

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

MLA Handbook (7th Edition):

Firoz, Jesun Sahariar. “Synchronization-avoiding graph algorithms and runtime aspects .” 2018. Web. 18 Mar 2019.

Vancouver:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Internet] [Thesis]. Indiana University; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2022/22605.

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

Council of Science Editors:

Firoz JS. Synchronization-avoiding graph algorithms and runtime aspects . [Thesis]. Indiana University; 2018. Available from: http://hdl.handle.net/2022/22605

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

2. Suzuki, Tsuyoshi. Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suzuki, T. (n.d.). Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/5073

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Suzuki, Tsuyoshi. “Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed March 18, 2019. http://hdl.handle.net/10061/5073.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Suzuki, Tsuyoshi. “Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ.” Web. 18 Mar 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Suzuki T. Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10061/5073.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Suzuki T. Studies on Mutual Exclusion Algorithm with Skipping Arbitration Tree for Shared Memory System : 共有メモリシステムにおける調停木スキップ相互排除アルゴリズムに関する研究; キョウユウ メモリ システム ニ オケル チョウテイギ スキップ ソウゴ ハイジョ アルゴリズム ニカンスル ケンキュウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/5073

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

3. Rietman, F.J. A relational calculus for the design of distributed algorithms.

Degree: 1995, University Utrecht

 In deze moderne tijd wordt het kunnen localiseren en verkrijgen van de juiste informatie steeds belangrijker. Wil je goede service leveren of de concurrent aftroeven,… (more)

Subjects/Keywords: distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rietman, F. J. (1995). A relational calculus for the design of distributed algorithms. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/840 ; URN:NBN:NL:UI:10-1874-840 ; URN:NBN:NL:UI:10-1874-840 ; http://dspace.library.uu.nl/handle/1874/840

Chicago Manual of Style (16th Edition):

Rietman, F J. “A relational calculus for the design of distributed algorithms.” 1995. Doctoral Dissertation, University Utrecht. Accessed March 18, 2019. http://dspace.library.uu.nl/handle/1874/840 ; URN:NBN:NL:UI:10-1874-840 ; URN:NBN:NL:UI:10-1874-840 ; http://dspace.library.uu.nl/handle/1874/840.

MLA Handbook (7th Edition):

Rietman, F J. “A relational calculus for the design of distributed algorithms.” 1995. Web. 18 Mar 2019.

Vancouver:

Rietman FJ. A relational calculus for the design of distributed algorithms. [Internet] [Doctoral dissertation]. University Utrecht; 1995. [cited 2019 Mar 18]. Available from: http://dspace.library.uu.nl/handle/1874/840 ; URN:NBN:NL:UI:10-1874-840 ; URN:NBN:NL:UI:10-1874-840 ; http://dspace.library.uu.nl/handle/1874/840.

Council of Science Editors:

Rietman FJ. A relational calculus for the design of distributed algorithms. [Doctoral Dissertation]. University Utrecht; 1995. Available from: http://dspace.library.uu.nl/handle/1874/840 ; URN:NBN:NL:UI:10-1874-840 ; URN:NBN:NL:UI:10-1874-840 ; http://dspace.library.uu.nl/handle/1874/840


University of Illinois – Urbana-Champaign

4. Doan, Thinh Thanh. On the performance of distributed algorithms for network optimization problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 This thesis considers optimization problems defined over a network of nodes, where each node knows only part of the objective functions. We are motivated by… (more)

Subjects/Keywords: Distributed algorithms; optimization; control theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doan, T. T. (2018). On the performance of distributed algorithms for network optimization problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100998

Chicago Manual of Style (16th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 18, 2019. http://hdl.handle.net/2142/100998.

MLA Handbook (7th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Web. 18 Mar 2019.

Vancouver:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2142/100998.

Council of Science Editors:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100998


Rice University

5. Gao, Zekai. Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices.

Degree: MS, Engineering, 2014, Rice University

 Computation of covariance matrices from observed data is an important problem, as such matrices are used in applications such as PCA, LDA, and increasingly in… (more)

Subjects/Keywords: Distributed algorithms; covariance matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, Z. (2014). Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/87863

Chicago Manual of Style (16th Edition):

Gao, Zekai. “Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices.” 2014. Masters Thesis, Rice University. Accessed March 18, 2019. http://hdl.handle.net/1911/87863.

MLA Handbook (7th Edition):

Gao, Zekai. “Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices.” 2014. Web. 18 Mar 2019.

Vancouver:

Gao Z. Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices. [Internet] [Masters thesis]. Rice University; 2014. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1911/87863.

Council of Science Editors:

Gao Z. Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices. [Masters Thesis]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87863


University of Texas – Austin

6. -6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.

Degree: Computer Sciences, 2018, University of Texas – Austin

 In this thesis we study the problem of computing Betweenness Centrality in dynamic and distributed networks. Betweenness Centrality (BC) is a well-known measure for the… (more)

Subjects/Keywords: Betweenness centrality; Dynamic algorithms; Distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-6879-6322. (2018). Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63353

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

Chicago Manual of Style (16th Edition):

-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Thesis, University of Texas – Austin. Accessed March 18, 2019. http://hdl.handle.net/2152/63353.

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

MLA Handbook (7th Edition):

-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Web. 18 Mar 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2152/63353.

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

Council of Science Editors:

-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63353

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

7. Das, Sanghamitra. Application semantics based optimization of distributed algorithm.

Degree: PhD, Department of Computing and Information Sciences, 2012, Kansas State University

 To increase their applicability, distributed algorithms are typically written to work with any application on any network. This flexibility comes at the cost of performance… (more)

Subjects/Keywords: Optimization of distributed algorithms; Distributed algorithms; Computer Science (0984)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, S. (2012). Application semantics based optimization of distributed algorithm. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/15056

Chicago Manual of Style (16th Edition):

Das, Sanghamitra. “Application semantics based optimization of distributed algorithm.” 2012. Doctoral Dissertation, Kansas State University. Accessed March 18, 2019. http://hdl.handle.net/2097/15056.

MLA Handbook (7th Edition):

Das, Sanghamitra. “Application semantics based optimization of distributed algorithm.” 2012. Web. 18 Mar 2019.

Vancouver:

Das S. Application semantics based optimization of distributed algorithm. [Internet] [Doctoral dissertation]. Kansas State University; 2012. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2097/15056.

Council of Science Editors:

Das S. Application semantics based optimization of distributed algorithm. [Doctoral Dissertation]. Kansas State University; 2012. Available from: http://hdl.handle.net/2097/15056


Jawaharlal Nehru University

8. Gupta, Sangita. Delay optimal mutual exclusion algorithms in distributed systems;.

Degree:  – , 1998, Jawaharlal Nehru University

Driven by technological advances as well as user needs, the field of distributed newlinecomputing is a natural evolution in computing history. With the distribution of… (more)

Subjects/Keywords: distributed systems; Delay optimal mutual exclusion; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, S. (1998). Delay optimal mutual exclusion algorithms in distributed systems;. (Thesis). Jawaharlal Nehru University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/17294

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, Sangita. “Delay optimal mutual exclusion algorithms in distributed systems;.” 1998. Thesis, Jawaharlal Nehru University. Accessed March 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/17294.

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

MLA Handbook (7th Edition):

Gupta, Sangita. “Delay optimal mutual exclusion algorithms in distributed systems;.” 1998. Web. 18 Mar 2019.

Vancouver:

Gupta S. Delay optimal mutual exclusion algorithms in distributed systems;. [Internet] [Thesis]. Jawaharlal Nehru University; 1998. [cited 2019 Mar 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17294.

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

Council of Science Editors:

Gupta S. Delay optimal mutual exclusion algorithms in distributed systems;. [Thesis]. Jawaharlal Nehru University; 1998. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17294

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


University of Edinburgh

9. Ridge, Thomas. Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols.

Degree: 2006, University of Edinburgh

 This thesis was motivated by a case study involving the formalisation of arguments that simplify the verification of tree-oriented multicast protocols. As well as covering… (more)

Subjects/Keywords: 510; automated theorem proving; distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ridge, T. (2006). Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/1461

Chicago Manual of Style (16th Edition):

Ridge, Thomas. “Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols.” 2006. Doctoral Dissertation, University of Edinburgh. Accessed March 18, 2019. http://hdl.handle.net/1842/1461.

MLA Handbook (7th Edition):

Ridge, Thomas. “Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols.” 2006. Web. 18 Mar 2019.

Vancouver:

Ridge T. Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols. [Internet] [Doctoral dissertation]. University of Edinburgh; 2006. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1842/1461.

Council of Science Editors:

Ridge T. Enhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols. [Doctoral Dissertation]. University of Edinburgh; 2006. Available from: http://hdl.handle.net/1842/1461


Universiteit Utrecht

10. Plattel, C.J. Distributed and Incremental Clustering using Shared Nearest Neighbours.

Degree: 2014, Universiteit Utrecht

 Cluster analysis is a large field inside data mining. It tries to capture the structure of a data set by grouping similar data points into… (more)

Subjects/Keywords: Clustering; Algorithms; Incremental; Distributed; Shared Nearest Neighbour

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Plattel, C. J. (2014). Distributed and Incremental Clustering using Shared Nearest Neighbours. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/296602

Chicago Manual of Style (16th Edition):

Plattel, C J. “Distributed and Incremental Clustering using Shared Nearest Neighbours.” 2014. Masters Thesis, Universiteit Utrecht. Accessed March 18, 2019. http://dspace.library.uu.nl:8080/handle/1874/296602.

MLA Handbook (7th Edition):

Plattel, C J. “Distributed and Incremental Clustering using Shared Nearest Neighbours.” 2014. Web. 18 Mar 2019.

Vancouver:

Plattel CJ. Distributed and Incremental Clustering using Shared Nearest Neighbours. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Mar 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/296602.

Council of Science Editors:

Plattel CJ. Distributed and Incremental Clustering using Shared Nearest Neighbours. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/296602


University of California – San Diego

11. Gravelle, Evan. Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems.

Degree: Engineering Sciences (Mechanical Engineering), 2017, University of California – San Diego

 There are many benefits of solving problems in a decentralized manner. Distributed algorithms often do not require global information which can alleviate the curse of… (more)

Subjects/Keywords: Mechanical engineering; distributed algorithms; traffic systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gravelle, E. (2017). Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/1j90h6bp

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

Gravelle, Evan. “Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems.” 2017. Thesis, University of California – San Diego. Accessed March 18, 2019. http://www.escholarship.org/uc/item/1j90h6bp.

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

MLA Handbook (7th Edition):

Gravelle, Evan. “Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems.” 2017. Web. 18 Mar 2019.

Vancouver:

Gravelle E. Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2019 Mar 18]. Available from: http://www.escholarship.org/uc/item/1j90h6bp.

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

Council of Science Editors:

Gravelle E. Design and Analysis of Distributed Algorithms with Applications to Networked Traffic Systems. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/1j90h6bp

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


Kansas State University

12. Nuthi, Kranthi Kiran. A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit.

Degree: MS, Department of Computing and Information Sciences, 2009, Kansas State University

 PROMELA stands for Protocol Meta Language. It is a modeling language for developing distributed systems. It allows for the dynamic creation of concurrent processes which… (more)

Subjects/Keywords: PROMELA; DAJ; Distributed Algorithms; Computer Science (0984)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nuthi, K. K. (2009). A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/2311

Chicago Manual of Style (16th Edition):

Nuthi, Kranthi Kiran. “A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit.” 2009. Masters Thesis, Kansas State University. Accessed March 18, 2019. http://hdl.handle.net/2097/2311.

MLA Handbook (7th Edition):

Nuthi, Kranthi Kiran. “A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit.” 2009. Web. 18 Mar 2019.

Vancouver:

Nuthi KK. A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit. [Internet] [Masters thesis]. Kansas State University; 2009. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2097/2311.

Council of Science Editors:

Nuthi KK. A tool for implementing distributed algorithms written in PROMELA, using DAJ toolkit. [Masters Thesis]. Kansas State University; 2009. Available from: http://hdl.handle.net/2097/2311


Delft University of Technology

13. Krom, B.N. Synchronization of Wireless Sensor Networks:.

Degree: 2015, Delft University of Technology

 Wireless sensor networks of the type discussed in this MSc project play a crucial role in many envisionings of the Internet of Things, a trend… (more)

Subjects/Keywords: Wireless Sensor Networks; Synchronization; Distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krom, B. N. (2015). Synchronization of Wireless Sensor Networks:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:8a25e95c-ef64-4e8f-a390-7f0fd3c29510

Chicago Manual of Style (16th Edition):

Krom, B N. “Synchronization of Wireless Sensor Networks:.” 2015. Masters Thesis, Delft University of Technology. Accessed March 18, 2019. http://resolver.tudelft.nl/uuid:8a25e95c-ef64-4e8f-a390-7f0fd3c29510.

MLA Handbook (7th Edition):

Krom, B N. “Synchronization of Wireless Sensor Networks:.” 2015. Web. 18 Mar 2019.

Vancouver:

Krom BN. Synchronization of Wireless Sensor Networks:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Mar 18]. Available from: http://resolver.tudelft.nl/uuid:8a25e95c-ef64-4e8f-a390-7f0fd3c29510.

Council of Science Editors:

Krom BN. Synchronization of Wireless Sensor Networks:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:8a25e95c-ef64-4e8f-a390-7f0fd3c29510


Texas A&M University

14. Talmage, Edward L. Towards Understanding Relaxations of Distributed Data Structures.

Degree: PhD, Computer Science, 2018, Texas A&M University

 Since computers are widespread and interconnected, the study of computing has expanded to encompass problems arising from concurrency and the need for coordinated effort between… (more)

Subjects/Keywords: Distributed Computing; Shared Memory; Relaxations; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Talmage, E. L. (2018). Towards Understanding Relaxations of Distributed Data Structures. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173426

Chicago Manual of Style (16th Edition):

Talmage, Edward L. “Towards Understanding Relaxations of Distributed Data Structures.” 2018. Doctoral Dissertation, Texas A&M University. Accessed March 18, 2019. http://hdl.handle.net/1969.1/173426.

MLA Handbook (7th Edition):

Talmage, Edward L. “Towards Understanding Relaxations of Distributed Data Structures.” 2018. Web. 18 Mar 2019.

Vancouver:

Talmage EL. Towards Understanding Relaxations of Distributed Data Structures. [Internet] [Doctoral dissertation]. Texas A&M University; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1969.1/173426.

Council of Science Editors:

Talmage EL. Towards Understanding Relaxations of Distributed Data Structures. [Doctoral Dissertation]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173426


University of Texas – Austin

15. Chauhan, Himanshu. Algorithms for analyzing parallel computations.

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

 Predicate detection is a powerful technique to verify parallel programs. Verifying correctness of programs using this technique involves two steps: first we create a partial… (more)

Subjects/Keywords: Algorithms; Theory; Distributed computing; Verification; Predication detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chauhan, H. (2018). Algorithms for analyzing parallel computations. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63631

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

Chauhan, Himanshu. “Algorithms for analyzing parallel computations.” 2018. Thesis, University of Texas – Austin. Accessed March 18, 2019. http://hdl.handle.net/2152/63631.

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

MLA Handbook (7th Edition):

Chauhan, Himanshu. “Algorithms for analyzing parallel computations.” 2018. Web. 18 Mar 2019.

Vancouver:

Chauhan H. Algorithms for analyzing parallel computations. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2152/63631.

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

Council of Science Editors:

Chauhan H. Algorithms for analyzing parallel computations. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63631

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


Rice University

16. Zhou, Yu. Swarm Robotics: Measurement and Sorting.

Degree: MS, Engineering, 2015, Rice University

 To measure is an important ability for robots to sense the environment and nearby robots. Although camera, laser, and ultrasonic provide very accurate measurements, they… (more)

Subjects/Keywords: Swarm Robotics; Physical Sorting; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Y. (2015). Swarm Robotics: Measurement and Sorting. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/88413

Chicago Manual of Style (16th Edition):

Zhou, Yu. “Swarm Robotics: Measurement and Sorting.” 2015. Masters Thesis, Rice University. Accessed March 18, 2019. http://hdl.handle.net/1911/88413.

MLA Handbook (7th Edition):

Zhou, Yu. “Swarm Robotics: Measurement and Sorting.” 2015. Web. 18 Mar 2019.

Vancouver:

Zhou Y. Swarm Robotics: Measurement and Sorting. [Internet] [Masters thesis]. Rice University; 2015. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1911/88413.

Council of Science Editors:

Zhou Y. Swarm Robotics: Measurement and Sorting. [Masters Thesis]. Rice University; 2015. Available from: http://hdl.handle.net/1911/88413


University of Pennsylvania

17. Hu, Yichuan. Distributed Algorithms for the Optimal Design of Wireless Networks.

Degree: 2013, University of Pennsylvania

 This thesis studies the problem of optimal design of wireless networks whose operating points such as powers, routes and channel capacities are solutions for an… (more)

Subjects/Keywords: Distributed algorithms; Wireless networks; Electrical and Electronics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, Y. (2013). Distributed Algorithms for the Optimal Design of Wireless Networks. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/876

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

Hu, Yichuan. “Distributed Algorithms for the Optimal Design of Wireless Networks.” 2013. Thesis, University of Pennsylvania. Accessed March 18, 2019. https://repository.upenn.edu/edissertations/876.

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

MLA Handbook (7th Edition):

Hu, Yichuan. “Distributed Algorithms for the Optimal Design of Wireless Networks.” 2013. Web. 18 Mar 2019.

Vancouver:

Hu Y. Distributed Algorithms for the Optimal Design of Wireless Networks. [Internet] [Thesis]. University of Pennsylvania; 2013. [cited 2019 Mar 18]. Available from: https://repository.upenn.edu/edissertations/876.

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

Council of Science Editors:

Hu Y. Distributed Algorithms for the Optimal Design of Wireless Networks. [Thesis]. University of Pennsylvania; 2013. Available from: https://repository.upenn.edu/edissertations/876

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


Drexel University

18. Chu, Xiaoyu. Distributed algorithms for extending the functional lifetime of wireless sensor networks.

Degree: 2014, Drexel University

The functional lifetime of a wireless sensor network (WSN) is among its most important features and serves as an essential metric in the evaluation of… (more)

Subjects/Keywords: Computer engineering; Wireless sensor networks; Distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chu, X. (2014). Distributed algorithms for extending the functional lifetime of wireless sensor networks. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/idea:6015

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

Chu, Xiaoyu. “Distributed algorithms for extending the functional lifetime of wireless sensor networks.” 2014. Thesis, Drexel University. Accessed March 18, 2019. http://hdl.handle.net/1860/idea:6015.

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

MLA Handbook (7th Edition):

Chu, Xiaoyu. “Distributed algorithms for extending the functional lifetime of wireless sensor networks.” 2014. Web. 18 Mar 2019.

Vancouver:

Chu X. Distributed algorithms for extending the functional lifetime of wireless sensor networks. [Internet] [Thesis]. Drexel University; 2014. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1860/idea:6015.

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

Council of Science Editors:

Chu X. Distributed algorithms for extending the functional lifetime of wireless sensor networks. [Thesis]. Drexel University; 2014. Available from: http://hdl.handle.net/1860/idea:6015

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


Georgia Tech

19. Jones, Malachi Gabriel. Design and implementation of a multi-agent systems laboratory.

Degree: MS, Electrical and Computer Engineering, 2009, Georgia Tech

 This thesis presents the design, development, and testing of a multi-agent systems laboratory that will enable the experimental investigation of Networked Control Systems. Networked Control… (more)

Subjects/Keywords: Distributed algorithms; Localization; Multi-agent system; Computer networks; Robust control; Distributed algorithms; Multisensor data fusion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jones, M. G. (2009). Design and implementation of a multi-agent systems laboratory. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29617

Chicago Manual of Style (16th Edition):

Jones, Malachi Gabriel. “Design and implementation of a multi-agent systems laboratory.” 2009. Masters Thesis, Georgia Tech. Accessed March 18, 2019. http://hdl.handle.net/1853/29617.

MLA Handbook (7th Edition):

Jones, Malachi Gabriel. “Design and implementation of a multi-agent systems laboratory.” 2009. Web. 18 Mar 2019.

Vancouver:

Jones MG. Design and implementation of a multi-agent systems laboratory. [Internet] [Masters thesis]. Georgia Tech; 2009. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1853/29617.

Council of Science Editors:

Jones MG. Design and implementation of a multi-agent systems laboratory. [Masters Thesis]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29617


Tartu University

20. Jakovits, Pelle. Adapting scientific computing algorithms to distributed computing frameworks .

Degree: 2017, Tartu University

 Teadusarvutuses kasutatakse arvuteid ja algoritme selleks, et lahendada probleeme erinevates reaalteadustes nagu geneetika, bioloogia ja keemia. Tihti on eesmärgiks selliste loodusnähtuste modelleerimine ja simuleerimine, mida… (more)

Subjects/Keywords: teadusarvutused; algoritmid; hajusarvutus; hajussüsteemid; scientific computing; algorithms; distributed computing; distributed systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jakovits, P. (2017). Adapting scientific computing algorithms to distributed computing frameworks . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/55459

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

Jakovits, Pelle. “Adapting scientific computing algorithms to distributed computing frameworks .” 2017. Thesis, Tartu University. Accessed March 18, 2019. http://hdl.handle.net/10062/55459.

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

MLA Handbook (7th Edition):

Jakovits, Pelle. “Adapting scientific computing algorithms to distributed computing frameworks .” 2017. Web. 18 Mar 2019.

Vancouver:

Jakovits P. Adapting scientific computing algorithms to distributed computing frameworks . [Internet] [Thesis]. Tartu University; 2017. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10062/55459.

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

Council of Science Editors:

Jakovits P. Adapting scientific computing algorithms to distributed computing frameworks . [Thesis]. Tartu University; 2017. Available from: http://hdl.handle.net/10062/55459

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


Northeastern University

21. Roche, Scott T. Robust local algorithms for communication and stability in distributed networks.

Degree: PhD, Computer Science Program, 2017, Northeastern University

 In a world in which our technological infrastructure is increasingly reliant on platforms that are distributed in nature, there is a substantial need for distributed(more)

Subjects/Keywords: applied graph theory; distributed algorithms; epidemic processes; randomized algorithms; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roche, S. T. (2017). Robust local algorithms for communication and stability in distributed networks. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20247295

Chicago Manual of Style (16th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Doctoral Dissertation, Northeastern University. Accessed March 18, 2019. http://hdl.handle.net/2047/D20247295.

MLA Handbook (7th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Web. 18 Mar 2019.

Vancouver:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2047/D20247295.

Council of Science Editors:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20247295


Anna University

22. Srinivasan.S. Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;.

Degree: 2013, Anna University

Deadlock is one of the canonical problems in distributed systems. It arises naturally in distributed systems such as distributed databases, distributed operating systems and store… (more)

Subjects/Keywords: Deadlock; generalized model; centralized algorithms; distributed algorithms; JAVA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srinivasan.S. (2013). Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/13650

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

Chicago Manual of Style (16th Edition):

Srinivasan.S. “Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;.” 2013. Thesis, Anna University. Accessed March 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/13650.

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

MLA Handbook (7th Edition):

Srinivasan.S. “Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;.” 2013. Web. 18 Mar 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Srinivasan.S. Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;. [Internet] [Thesis]. Anna University; 2013. [cited 2019 Mar 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13650.

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

Council of Science Editors:

Srinivasan.S. Efficient design and evaluation of distributed deadlock detection and resolution in generalized model;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13650

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


Queens University

23. Islam, Md Kamrul. Energy aware techniques for certain problems in Wireless Sensor Networks .

Degree: Computing, 2010, Queens University

 Recent years have witnessed a tremendous amount of research in the field of wireless sensor networks (WSNs) due to their numerous real-world applications in environmental… (more)

Subjects/Keywords: Wireless Sensor Networks; Distributed Algorithms; Energy Aware Techniques; Local Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Islam, M. K. (2010). Energy aware techniques for certain problems in Wireless Sensor Networks . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/5588

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

Islam, Md Kamrul. “Energy aware techniques for certain problems in Wireless Sensor Networks .” 2010. Thesis, Queens University. Accessed March 18, 2019. http://hdl.handle.net/1974/5588.

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

MLA Handbook (7th Edition):

Islam, Md Kamrul. “Energy aware techniques for certain problems in Wireless Sensor Networks .” 2010. Web. 18 Mar 2019.

Vancouver:

Islam MK. Energy aware techniques for certain problems in Wireless Sensor Networks . [Internet] [Thesis]. Queens University; 2010. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1974/5588.

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

Council of Science Editors:

Islam MK. Energy aware techniques for certain problems in Wireless Sensor Networks . [Thesis]. Queens University; 2010. Available from: http://hdl.handle.net/1974/5588

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


ETH Zürich

24. Rey, Felix. ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure.

Degree: 2018, ETH Zürich

 The alternating direction method of multipliers (ADMM) is a first-order optimization algorithm for solving convex problems. We study ADMM under a specialization paradigm, which means… (more)

Subjects/Keywords: ADMM; Optimization algorithms; Distributed algorithms; Model predictive control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rey, F. (2018). ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/311505

Chicago Manual of Style (16th Edition):

Rey, Felix. “ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure.” 2018. Doctoral Dissertation, ETH Zürich. Accessed March 18, 2019. http://hdl.handle.net/20.500.11850/311505.

MLA Handbook (7th Edition):

Rey, Felix. “ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure.” 2018. Web. 18 Mar 2019.

Vancouver:

Rey F. ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/20.500.11850/311505.

Council of Science Editors:

Rey F. ADMM in Optimization and Control: Algorithm Specialization, Computational Distribution, and the Value of Structure. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/311505


Texas A&M University

25. Bulluck, Matthew James. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.

Degree: MS, Computer Science, 2017, Texas A&M University

 Motion planning is the problem of finding a valid path for a robot from a start position to a goal position. It has many uses… (more)

Subjects/Keywords: Robotic Motion Planning; Sampling-based Motion Planning; Parallel Algorithms; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bulluck, M. J. (2017). A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169642

Chicago Manual of Style (16th Edition):

Bulluck, Matthew James. “A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.” 2017. Masters Thesis, Texas A&M University. Accessed March 18, 2019. http://hdl.handle.net/1969.1/169642.

MLA Handbook (7th Edition):

Bulluck, Matthew James. “A Framework For Parallelizing Sampling-Based Motion Planning Algorithms.” 2017. Web. 18 Mar 2019.

Vancouver:

Bulluck MJ. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/1969.1/169642.

Council of Science Editors:

Bulluck MJ. A Framework For Parallelizing Sampling-Based Motion Planning Algorithms. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169642


Virginia Tech

26. Pei, Guanhong. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.

Degree: PhD, Electrical and Computer Engineering, 2013, Virginia Tech

 We investigate diverse aspects of the performance of wireless networks, including throughput, delay and distributed complexity. One of the main challenges for optimizing them arises… (more)

Subjects/Keywords: Wireless Networks; Cross-layer Design; Physical Interference; Approximation Algorithms; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pei, G. (2013). Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/19219

Chicago Manual of Style (16th Edition):

Pei, Guanhong. “Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.” 2013. Doctoral Dissertation, Virginia Tech. Accessed March 18, 2019. http://hdl.handle.net/10919/19219.

MLA Handbook (7th Edition):

Pei, Guanhong. “Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model.” 2013. Web. 18 Mar 2019.

Vancouver:

Pei G. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. [Internet] [Doctoral dissertation]. Virginia Tech; 2013. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10919/19219.

Council of Science Editors:

Pei G. Distributed Scheduling and Delay-Throughput Optimization in Wireless Networks under the Physical Interference Model. [Doctoral Dissertation]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/19219

27. Lammersen, Christiane. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.

Degree: 2010, Technische Universität Dortmund

 This thesis addresses the development of geometric approximation algorithms for huge datasets and is subdivided into two parts. The first part deals with algorithms for… (more)

Subjects/Keywords: approximation algorithms; clustering; distributed algorithms; embedding; facility location; kinetic data structures; streaming algorithms; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lammersen, C. (2010). Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27597

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

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Thesis, Technische Universität Dortmund. Accessed March 18, 2019. http://hdl.handle.net/2003/27597.

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

MLA Handbook (7th Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Web. 18 Mar 2019.

Vancouver:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Internet] [Thesis]. Technische Universität Dortmund; 2010. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/2003/27597.

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

Council of Science Editors:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Thesis]. Technische Universität Dortmund; 2010. Available from: http://hdl.handle.net/2003/27597

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


University of Iowa

28. Pandit, Saurav. Approximation algorithms for distributed systems.

Degree: PhD, Computer Science, 2010, University of Iowa

Distributed Approximation is a new and rapidly developing discipline that lies at the crossroads of various well-established areas of Computer Science - Distributed Computing,… (more)

Subjects/Keywords: Approximation algorithms; Complexity; Distributed algorithms; Randomized algorithms; Wireless sensor networks; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandit, S. (2010). Approximation algorithms for distributed systems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/870

Chicago Manual of Style (16th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Doctoral Dissertation, University of Iowa. Accessed March 18, 2019. https://ir.uiowa.edu/etd/870.

MLA Handbook (7th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Web. 18 Mar 2019.

Vancouver:

Pandit S. Approximation algorithms for distributed systems. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 Mar 18]. Available from: https://ir.uiowa.edu/etd/870.

Council of Science Editors:

Pandit S. Approximation algorithms for distributed systems. [Doctoral Dissertation]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/870


University of Texas – Austin

29. 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 March 18, 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. 18 Mar 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 Mar 18]. 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


Robert Gordon University

30. Magaji, Amina Sambo-Muhammad. Combining search strategies for distributed constraint satisfaction.

Degree: PhD, 2015, Robert Gordon University

 Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs)… (more)

Subjects/Keywords: 005.1; Distributed constraint satisfaction; Distributed problem solving; Local search; Algorithms; Local optima; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magaji, A. S. (2015). Combining search strategies for distributed constraint satisfaction. (Doctoral Dissertation). Robert Gordon University. Retrieved from http://hdl.handle.net/10059/1374

Chicago Manual of Style (16th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Doctoral Dissertation, Robert Gordon University. Accessed March 18, 2019. http://hdl.handle.net/10059/1374.

MLA Handbook (7th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Web. 18 Mar 2019.

Vancouver:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Internet] [Doctoral dissertation]. Robert Gordon University; 2015. [cited 2019 Mar 18]. Available from: http://hdl.handle.net/10059/1374.

Council of Science Editors:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Doctoral Dissertation]. Robert Gordon University; 2015. Available from: http://hdl.handle.net/10059/1374

[1] [2] [3] [4] [5] … [13]

.