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

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

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Notre Dame

1. Quinn Culver. Topics in Algorithmic Randomness and Effective Probability</h1>.

Degree: Mathematics, 2015, University of Notre Dame

  This dissertation contains the results from three related projects, each within the fields of algorithmic randomness and probability theory. The first project we undertake,… (more)

Subjects/Keywords: algorithmic randomness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Culver, Q. (2015). Topics in Algorithmic Randomness and Effective Probability</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/g445cc10r03

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

Culver, Quinn. “Topics in Algorithmic Randomness and Effective Probability</h1>.” 2015. Thesis, University of Notre Dame. Accessed September 19, 2020. https://curate.nd.edu/show/g445cc10r03.

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

MLA Handbook (7th Edition):

Culver, Quinn. “Topics in Algorithmic Randomness and Effective Probability</h1>.” 2015. Web. 19 Sep 2020.

Vancouver:

Culver Q. Topics in Algorithmic Randomness and Effective Probability</h1>. [Internet] [Thesis]. University of Notre Dame; 2015. [cited 2020 Sep 19]. Available from: https://curate.nd.edu/show/g445cc10r03.

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

Council of Science Editors:

Culver Q. Topics in Algorithmic Randomness and Effective Probability</h1>. [Thesis]. University of Notre Dame; 2015. Available from: https://curate.nd.edu/show/g445cc10r03

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


Cornell University

2. Oren, Sigal. An Algorithmic Approach To Analyzing Social Phenomena.

Degree: PhD, Computer Science, 2013, Cornell University

 Online information and interaction is becoming more and more prominent in our lives. This development is made possible by the growth of large-scale userbased applications… (more)

Subjects/Keywords: Algorithmic game theory; social networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oren, S. (2013). An Algorithmic Approach To Analyzing Social Phenomena. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/34358

Chicago Manual of Style (16th Edition):

Oren, Sigal. “An Algorithmic Approach To Analyzing Social Phenomena.” 2013. Doctoral Dissertation, Cornell University. Accessed September 19, 2020. http://hdl.handle.net/1813/34358.

MLA Handbook (7th Edition):

Oren, Sigal. “An Algorithmic Approach To Analyzing Social Phenomena.” 2013. Web. 19 Sep 2020.

Vancouver:

Oren S. An Algorithmic Approach To Analyzing Social Phenomena. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1813/34358.

Council of Science Editors:

Oren S. An Algorithmic Approach To Analyzing Social Phenomena. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/34358


University of Johannesburg

3. Overmars, Michelle. A multi-agent system framework for agent coordination and communication enabling algorithmic trading.

Degree: 2012, University of Johannesburg

M.Sc.

Advancements in technology used in financial markets have led to substantial automation of tasks within the financial industry. Data analysis, trade execution and trade… (more)

Subjects/Keywords: Algorithmic trading; Multi-agent system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Overmars, M. (2012). A multi-agent system framework for agent coordination and communication enabling algorithmic trading. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/5100

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

Overmars, Michelle. “A multi-agent system framework for agent coordination and communication enabling algorithmic trading.” 2012. Thesis, University of Johannesburg. Accessed September 19, 2020. http://hdl.handle.net/10210/5100.

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

MLA Handbook (7th Edition):

Overmars, Michelle. “A multi-agent system framework for agent coordination and communication enabling algorithmic trading.” 2012. Web. 19 Sep 2020.

Vancouver:

Overmars M. A multi-agent system framework for agent coordination and communication enabling algorithmic trading. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10210/5100.

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

Council of Science Editors:

Overmars M. A multi-agent system framework for agent coordination and communication enabling algorithmic trading. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/5100

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


Queensland University of Technology

4. Rasmussen, Rune K. Algorithmic approaches for playing and solving Shannon games.

Degree: 2008, Queensland University of Technology

 The game of Hex is a board game that belongs to the family of Shannon games, which are connection-oriented games where players must secure certain… (more)

Subjects/Keywords: Shannon games; algorithmic approaches

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rasmussen, R. K. (2008). Algorithmic approaches for playing and solving Shannon games. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/18616/

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

Rasmussen, Rune K. “Algorithmic approaches for playing and solving Shannon games.” 2008. Thesis, Queensland University of Technology. Accessed September 19, 2020. https://eprints.qut.edu.au/18616/.

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

MLA Handbook (7th Edition):

Rasmussen, Rune K. “Algorithmic approaches for playing and solving Shannon games.” 2008. Web. 19 Sep 2020.

Vancouver:

Rasmussen RK. Algorithmic approaches for playing and solving Shannon games. [Internet] [Thesis]. Queensland University of Technology; 2008. [cited 2020 Sep 19]. Available from: https://eprints.qut.edu.au/18616/.

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

Council of Science Editors:

Rasmussen RK. Algorithmic approaches for playing and solving Shannon games. [Thesis]. Queensland University of Technology; 2008. Available from: https://eprints.qut.edu.au/18616/

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


University of Debrecen

5. Hamam, Faris. On Algorithmic Game Theory .

Degree: DE – Informatikai Kar, University of Debrecen

An introduction to Game Theory and a combinatorial algorithm for calculating market equilibria, prices and goods allocation. Advisors/Committee Members: Gilányi, Attila (advisor).

Subjects/Keywords: Algorithmic Game

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamam, F. (n.d.). On Algorithmic Game Theory . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/238913

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

Hamam, Faris. “On Algorithmic Game Theory .” Thesis, University of Debrecen. Accessed September 19, 2020. http://hdl.handle.net/2437/238913.

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

Hamam, Faris. “On Algorithmic Game Theory .” Web. 19 Sep 2020.

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

Vancouver:

Hamam F. On Algorithmic Game Theory . [Internet] [Thesis]. University of Debrecen; [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2437/238913.

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:

Hamam F. On Algorithmic Game Theory . [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/238913

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


University of Notre Dame

6. Christopher Porter. Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>.

Degree: Philosophy, 2012, University of Notre Dame

  The mathematics portion of this dissertation is a study of the various interactions between definitions of algorithmic randomness, Turing functionals, and non-uniform probability measures… (more)

Subjects/Keywords: algorithmic randomness; philosophy of mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Porter, C. (2012). Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/cv43nv9583f

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

Porter, Christopher. “Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>.” 2012. Thesis, University of Notre Dame. Accessed September 19, 2020. https://curate.nd.edu/show/cv43nv9583f.

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

MLA Handbook (7th Edition):

Porter, Christopher. “Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>.” 2012. Web. 19 Sep 2020.

Vancouver:

Porter C. Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. [Internet] [Thesis]. University of Notre Dame; 2012. [cited 2020 Sep 19]. Available from: https://curate.nd.edu/show/cv43nv9583f.

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

Council of Science Editors:

Porter C. Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. [Thesis]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/cv43nv9583f

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


Rochester Institute of Technology

7. Ramji, Vignesh. Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment.

Degree: MS, Electrical Engineering, 2016, Rochester Institute of Technology

  The cure for Parkinson’s disease is considered as one of the greatest challenges in chronic neurological disorder therapy, motivating efforts to provide information to… (more)

Subjects/Keywords: Algorithmic approach; Parkinson's Disease; Tensor

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramji, V. (2016). Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9312

Chicago Manual of Style (16th Edition):

Ramji, Vignesh. “Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed September 19, 2020. https://scholarworks.rit.edu/theses/9312.

MLA Handbook (7th Edition):

Ramji, Vignesh. “Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment.” 2016. Web. 19 Sep 2020.

Vancouver:

Ramji V. Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2020 Sep 19]. Available from: https://scholarworks.rit.edu/theses/9312.

Council of Science Editors:

Ramji V. Tensor decomposition of multi-channel wearable sensors for Parkinson’s disease assessment. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9312


University of Illinois – Urbana-Champaign

8. Yu, Yingjie. A thesis on algorithmic trading.

Degree: MS, Industrial Engineering, 2015, University of Illinois – Urbana-Champaign

Algorithmic trading is one of the most phenomenal changes in the financial industry in the past decade. While the impacts are significant, the microstructure of… (more)

Subjects/Keywords: Algorithmic trading; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, Y. (2015). A thesis on algorithmic trading. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78679

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

Yu, Yingjie. “A thesis on algorithmic trading.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed September 19, 2020. http://hdl.handle.net/2142/78679.

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

MLA Handbook (7th Edition):

Yu, Yingjie. “A thesis on algorithmic trading.” 2015. Web. 19 Sep 2020.

Vancouver:

Yu Y. A thesis on algorithmic trading. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2142/78679.

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

Council of Science Editors:

Yu Y. A thesis on algorithmic trading. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78679

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


University of Alberta

9. Zeng, Linghang. Trading Large VWAP Orders in Discrete Time.

Degree: MS, Department of Mathematical and Statistical Sciences, 2013, University of Alberta

 This thesis focuses on characterizing an optimal trading strategy for a large trader, who has to buy (or sell) a fixed large volume over a… (more)

Subjects/Keywords: algorithmic trading, VWAP, discrete time, dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zeng, L. (2013). Trading Large VWAP Orders in Discrete Time. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/12579t58k

Chicago Manual of Style (16th Edition):

Zeng, Linghang. “Trading Large VWAP Orders in Discrete Time.” 2013. Masters Thesis, University of Alberta. Accessed September 19, 2020. https://era.library.ualberta.ca/files/12579t58k.

MLA Handbook (7th Edition):

Zeng, Linghang. “Trading Large VWAP Orders in Discrete Time.” 2013. Web. 19 Sep 2020.

Vancouver:

Zeng L. Trading Large VWAP Orders in Discrete Time. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2020 Sep 19]. Available from: https://era.library.ualberta.ca/files/12579t58k.

Council of Science Editors:

Zeng L. Trading Large VWAP Orders in Discrete Time. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/12579t58k


University of Victoria

10. Azami, Sajjad. Exploring fair machine learning in sequential prediction and supervised learning.

Degree: Department of Computer Science, 2020, University of Victoria

 Algorithms that are being used in sensitive contexts such as deciding to give a job offer or giving inmates parole should be accurate as well… (more)

Subjects/Keywords: Machine Learning; Online Learning; Algorithmic Fairness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Azami, S. (2020). Exploring fair machine learning in sequential prediction and supervised learning. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/12098

Chicago Manual of Style (16th Edition):

Azami, Sajjad. “Exploring fair machine learning in sequential prediction and supervised learning.” 2020. Masters Thesis, University of Victoria. Accessed September 19, 2020. http://hdl.handle.net/1828/12098.

MLA Handbook (7th Edition):

Azami, Sajjad. “Exploring fair machine learning in sequential prediction and supervised learning.” 2020. Web. 19 Sep 2020.

Vancouver:

Azami S. Exploring fair machine learning in sequential prediction and supervised learning. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1828/12098.

Council of Science Editors:

Azami S. Exploring fair machine learning in sequential prediction and supervised learning. [Masters Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/12098


Vanderbilt University

11. Hei, Songtao. A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data.

Degree: MS, Computer Science, 2015, Vanderbilt University

 A challenge for companies hiring software engineers is the large number of candidate profiles on LinkedIn, Monster.com, and other job websites and the inability to… (more)

Subjects/Keywords: GitHub; Algorithmic recruiting; machine learning; decision tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hei, S. (2015). A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/11151

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

Hei, Songtao. “A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data.” 2015. Thesis, Vanderbilt University. Accessed September 19, 2020. http://hdl.handle.net/1803/11151.

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

MLA Handbook (7th Edition):

Hei, Songtao. “A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data.” 2015. Web. 19 Sep 2020.

Vancouver:

Hei S. A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data. [Internet] [Thesis]. Vanderbilt University; 2015. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1803/11151.

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

Council of Science Editors:

Hei S. A Decision Tree Based Approach to Filter Candidates for Software Engineering Jobs Using GitHub Data. [Thesis]. Vanderbilt University; 2015. Available from: http://hdl.handle.net/1803/11151

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


University of Waterloo

12. Tofigzade, Natig. An Algorithm for Stable Matching with Approximation up to the Integrality Gap.

Degree: 2020, University of Waterloo

 In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of… (more)

Subjects/Keywords: Combinatorial Optimization; Stable Matching; Algorithmic Game Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tofigzade, N. (2020). An Algorithm for Stable Matching with Approximation up to the Integrality Gap. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16052

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

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Thesis, University of Waterloo. Accessed September 19, 2020. http://hdl.handle.net/10012/16052.

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

MLA Handbook (7th Edition):

Tofigzade, Natig. “An Algorithm for Stable Matching with Approximation up to the Integrality Gap.” 2020. Web. 19 Sep 2020.

Vancouver:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10012/16052.

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

Council of Science Editors:

Tofigzade N. An Algorithm for Stable Matching with Approximation up to the Integrality Gap. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16052

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

13. Globa, Anastasia. Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge.

Degree: 2015, Victoria University of Wellington

 This thesis tests the reuse of design knowledge as a method to support learning and use of algorithmic design in architecture. The use of algorithmic(more)

Subjects/Keywords: Algorithmic design; Parametric design; Design patterns

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Globa, A. (2015). Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/4391

Chicago Manual of Style (16th Edition):

Globa, Anastasia. “Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge.” 2015. Doctoral Dissertation, Victoria University of Wellington. Accessed September 19, 2020. http://hdl.handle.net/10063/4391.

MLA Handbook (7th Edition):

Globa, Anastasia. “Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge.” 2015. Web. 19 Sep 2020.

Vancouver:

Globa A. Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2015. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10063/4391.

Council of Science Editors:

Globa A. Supporting the use of algorithmic design in architecture: An empirical study of reuse of design knowledge. [Doctoral Dissertation]. Victoria University of Wellington; 2015. Available from: http://hdl.handle.net/10063/4391


University of Cincinnati

14. BARR, DAVID F. DATA ARTICULATION.

Degree: M. Arch., Design, Architecture, Art and Planning : Architecture (Master of), 2007, University of Cincinnati

 The onset of the digital revolution has forever altered society and architecture. This thesis addresses contemporary architectural practices as they are being radically reorganized through… (more)

Subjects/Keywords: Architecture; Emergence; Digital Architecture; Algorithmic Architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BARR, D. F. (2007). DATA ARTICULATION. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1187022382

Chicago Manual of Style (16th Edition):

BARR, DAVID F. “DATA ARTICULATION.” 2007. Masters Thesis, University of Cincinnati. Accessed September 19, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1187022382.

MLA Handbook (7th Edition):

BARR, DAVID F. “DATA ARTICULATION.” 2007. Web. 19 Sep 2020.

Vancouver:

BARR DF. DATA ARTICULATION. [Internet] [Masters thesis]. University of Cincinnati; 2007. [cited 2020 Sep 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1187022382.

Council of Science Editors:

BARR DF. DATA ARTICULATION. [Masters Thesis]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1187022382


Victoria University of Wellington

15. Haslop, Blaire. Digital Decay: Glitch Architecture.

Degree: 2016, Victoria University of Wellington

 We now live in a world where architecture is produced through arrays of pixels and this remains as the representation rather than the reality of… (more)

Subjects/Keywords: Glitch; Algorithmic design; Parametric; Computational design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haslop, B. (2016). Digital Decay: Glitch Architecture. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6902

Chicago Manual of Style (16th Edition):

Haslop, Blaire. “Digital Decay: Glitch Architecture.” 2016. Masters Thesis, Victoria University of Wellington. Accessed September 19, 2020. http://hdl.handle.net/10063/6902.

MLA Handbook (7th Edition):

Haslop, Blaire. “Digital Decay: Glitch Architecture.” 2016. Web. 19 Sep 2020.

Vancouver:

Haslop B. Digital Decay: Glitch Architecture. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10063/6902.

Council of Science Editors:

Haslop B. Digital Decay: Glitch Architecture. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/6902


Victoria University of Wellington

16. Paulin, Robert. Algorithmic Design in Hybrid Housing Systems.

Degree: 2017, Victoria University of Wellington

 This thesis utilises digital tools to explore notions of flexibility and resilience in the New Zealand suburban house typology. Through aligning with culturally specific paradigms… (more)

Subjects/Keywords: Modular; Indigenous housing; Algorithmic; Indigenous; Parametric

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paulin, R. (2017). Algorithmic Design in Hybrid Housing Systems. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6889

Chicago Manual of Style (16th Edition):

Paulin, Robert. “Algorithmic Design in Hybrid Housing Systems.” 2017. Masters Thesis, Victoria University of Wellington. Accessed September 19, 2020. http://hdl.handle.net/10063/6889.

MLA Handbook (7th Edition):

Paulin, Robert. “Algorithmic Design in Hybrid Housing Systems.” 2017. Web. 19 Sep 2020.

Vancouver:

Paulin R. Algorithmic Design in Hybrid Housing Systems. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10063/6889.

Council of Science Editors:

Paulin R. Algorithmic Design in Hybrid Housing Systems. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/6889


Universidade Nova

17. Marques, Ricardo Jorge dos Santos. Algorithmic skeleton framework for the orchestration of GPU computations.

Degree: 2012, Universidade Nova

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

The Graphics Processing Unit (GPU) is gaining popularity as a co-processor to the Central Processing… (more)

Subjects/Keywords: Algorithmic patterns (Skeletons); GPU computing; OpenCL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marques, R. J. d. S. (2012). Algorithmic skeleton framework for the orchestration of GPU computations. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8382

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

Marques, Ricardo Jorge dos Santos. “Algorithmic skeleton framework for the orchestration of GPU computations.” 2012. Thesis, Universidade Nova. Accessed September 19, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8382.

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

MLA Handbook (7th Edition):

Marques, Ricardo Jorge dos Santos. “Algorithmic skeleton framework for the orchestration of GPU computations.” 2012. Web. 19 Sep 2020.

Vancouver:

Marques RJdS. Algorithmic skeleton framework for the orchestration of GPU computations. [Internet] [Thesis]. Universidade Nova; 2012. [cited 2020 Sep 19]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8382.

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

Council of Science Editors:

Marques RJdS. Algorithmic skeleton framework for the orchestration of GPU computations. [Thesis]. Universidade Nova; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8382

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


Universidade Nova

18. Alexandre, Fernando Jorge Marques. Multi-GPU support on the marrow algorithmic skeleton framework.

Degree: 2013, Universidade Nova

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

With the proliferation of general purpose GPUs, workload parallelization and datatransfer optimization became an increasing… (more)

Subjects/Keywords: Algorithmic skeletons; Multiple GPUs; Auto-tuning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alexandre, F. J. M. (2013). Multi-GPU support on the marrow algorithmic skeleton framework. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10746

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

Alexandre, Fernando Jorge Marques. “Multi-GPU support on the marrow algorithmic skeleton framework.” 2013. Thesis, Universidade Nova. Accessed September 19, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10746.

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

MLA Handbook (7th Edition):

Alexandre, Fernando Jorge Marques. “Multi-GPU support on the marrow algorithmic skeleton framework.” 2013. Web. 19 Sep 2020.

Vancouver:

Alexandre FJM. Multi-GPU support on the marrow algorithmic skeleton framework. [Internet] [Thesis]. Universidade Nova; 2013. [cited 2020 Sep 19]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10746.

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

Council of Science Editors:

Alexandre FJM. Multi-GPU support on the marrow algorithmic skeleton framework. [Thesis]. Universidade Nova; 2013. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10746

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


Universidade Nova

19. Soldado, Fábio Miguel Cardoso. Heterogeneous computing with an algorithmic skeleton framework.

Degree: 2014, Universidade Nova

 The Graphics Processing Unit (GPU) is present in almost every modern day personal computer. Despite its specific purpose design, they have been increasingly used for… (more)

Subjects/Keywords: Algorithmic skeletons; OpenCL; GPGPU; Heterogeneous computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soldado, F. M. C. (2014). Heterogeneous computing with an algorithmic skeleton framework. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13245

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

Soldado, Fábio Miguel Cardoso. “Heterogeneous computing with an algorithmic skeleton framework.” 2014. Thesis, Universidade Nova. Accessed September 19, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13245.

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

MLA Handbook (7th Edition):

Soldado, Fábio Miguel Cardoso. “Heterogeneous computing with an algorithmic skeleton framework.” 2014. Web. 19 Sep 2020.

Vancouver:

Soldado FMC. Heterogeneous computing with an algorithmic skeleton framework. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2020 Sep 19]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13245.

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

Council of Science Editors:

Soldado FMC. Heterogeneous computing with an algorithmic skeleton framework. [Thesis]. Universidade Nova; 2014. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13245

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

20. Robson, Charlie. Computable Randomness, and Coding the Orbits of the Collatz Map.

Degree: PhD, 2017, Oregon State University

 In this thesis I will look at a definition of computable randomness from Algorithmic Information Theory as defined by Andre Nies through the lens of… (more)

Subjects/Keywords: Algorithmic Randomness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Robson, C. (2017). Computable Randomness, and Coding the Orbits of the Collatz Map. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/61676

Chicago Manual of Style (16th Edition):

Robson, Charlie. “Computable Randomness, and Coding the Orbits of the Collatz Map.” 2017. Doctoral Dissertation, Oregon State University. Accessed September 19, 2020. http://hdl.handle.net/1957/61676.

MLA Handbook (7th Edition):

Robson, Charlie. “Computable Randomness, and Coding the Orbits of the Collatz Map.” 2017. Web. 19 Sep 2020.

Vancouver:

Robson C. Computable Randomness, and Coding the Orbits of the Collatz Map. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1957/61676.

Council of Science Editors:

Robson C. Computable Randomness, and Coding the Orbits of the Collatz Map. [Doctoral Dissertation]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61676


Queen Mary, University of London

21. Hückelheim, Jan Christian. Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations.

Degree: PhD, 2017, Queen Mary, University of London

 Simulations are used in science and industry to predict the performance of technical systems. Adjoint derivatives of these simulations can reveal the sensitivity of the… (more)

Subjects/Keywords: Engineering and Materials Science; algorithmic differentiation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hückelheim, J. C. (2017). Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/24644 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765881

Chicago Manual of Style (16th Edition):

Hückelheim, Jan Christian. “Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations.” 2017. Doctoral Dissertation, Queen Mary, University of London. Accessed September 19, 2020. http://qmro.qmul.ac.uk/xmlui/handle/123456789/24644 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765881.

MLA Handbook (7th Edition):

Hückelheim, Jan Christian. “Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations.” 2017. Web. 19 Sep 2020.

Vancouver:

Hückelheim JC. Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2017. [cited 2020 Sep 19]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/24644 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765881.

Council of Science Editors:

Hückelheim JC. Discrete adjoints on many cores : algorithmic differentiation of accelerated fluid simulations. [Doctoral Dissertation]. Queen Mary, University of London; 2017. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/24644 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765881


University of Sydney

22. Zhang, Joe Ruiwang. An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading .

Degree: 2017, University of Sydney

 Motivated by the widespread adoption of AT in financial markets, this dissertation investigates whether algorithmic trading (AT) reduces the Post-Earnings Announcement Drift (PEAD), the financial… (more)

Subjects/Keywords: finance; financial markets; PEAD; algorithmic trading

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, J. R. (2017). An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/17086

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

Zhang, Joe Ruiwang. “An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading .” 2017. Thesis, University of Sydney. Accessed September 19, 2020. http://hdl.handle.net/2123/17086.

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

MLA Handbook (7th Edition):

Zhang, Joe Ruiwang. “An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading .” 2017. Web. 19 Sep 2020.

Vancouver:

Zhang JR. An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading . [Internet] [Thesis]. University of Sydney; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2123/17086.

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

Council of Science Editors:

Zhang JR. An Empirical Investigation On The Post-Earnings Announcement Drift And AlgorithmicTrading . [Thesis]. University of Sydney; 2017. Available from: http://hdl.handle.net/2123/17086

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


University of Sydney

23. Koenders, Michael. FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) .

Degree: 2016, University of Sydney

 This thesis reviews and discusses certain techniques from the domain of (Music) Information Retrieval, in particular some general data mining algorithms. It also describes their… (more)

Subjects/Keywords: Information Retrieval; data mining; Algorithmic composition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koenders, M. (2016). FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/16914

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

Koenders, Michael. “FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) .” 2016. Thesis, University of Sydney. Accessed September 19, 2020. http://hdl.handle.net/2123/16914.

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

MLA Handbook (7th Edition):

Koenders, Michael. “FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) .” 2016. Web. 19 Sep 2020.

Vancouver:

Koenders M. FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) . [Internet] [Thesis]. University of Sydney; 2016. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2123/16914.

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

Council of Science Editors:

Koenders M. FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM) . [Thesis]. University of Sydney; 2016. Available from: http://hdl.handle.net/2123/16914

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


Northeastern University

24. Chen, Le. Measuring algorithms in online marketplaces.

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

 The integration of Big Data and algorithms have revolutionized many aspects of modern life. One of the revolutions is happening in markets, where data-centric algorithms… (more)

Subjects/Keywords: algorithmic auditing; measurement; transparency; web-based services

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, L. (2017). Measuring algorithms in online marketplaces. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20251583

Chicago Manual of Style (16th Edition):

Chen, Le. “Measuring algorithms in online marketplaces.” 2017. Doctoral Dissertation, Northeastern University. Accessed September 19, 2020. http://hdl.handle.net/2047/D20251583.

MLA Handbook (7th Edition):

Chen, Le. “Measuring algorithms in online marketplaces.” 2017. Web. 19 Sep 2020.

Vancouver:

Chen L. Measuring algorithms in online marketplaces. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2047/D20251583.

Council of Science Editors:

Chen L. Measuring algorithms in online marketplaces. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20251583


Baylor University

25. Ewert, Winston. Algorithmic specified complexity.

Degree: PhD, Electrical and Computer Engineering., 2013, Baylor University

 Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of… (more)

Subjects/Keywords: Information.; Algorithmic specified complexity.; Kolmogorov complexity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ewert, W. (2013). Algorithmic specified complexity. (Doctoral Dissertation). Baylor University. Retrieved from http://hdl.handle.net/2104/8829

Chicago Manual of Style (16th Edition):

Ewert, Winston. “Algorithmic specified complexity.” 2013. Doctoral Dissertation, Baylor University. Accessed September 19, 2020. http://hdl.handle.net/2104/8829.

MLA Handbook (7th Edition):

Ewert, Winston. “Algorithmic specified complexity.” 2013. Web. 19 Sep 2020.

Vancouver:

Ewert W. Algorithmic specified complexity. [Internet] [Doctoral dissertation]. Baylor University; 2013. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2104/8829.

Council of Science Editors:

Ewert W. Algorithmic specified complexity. [Doctoral Dissertation]. Baylor University; 2013. Available from: http://hdl.handle.net/2104/8829

26. Kiselev, Ilya. Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index.

Degree: Economics, 2012, Jönköping UniversityJönköping University

  The research at hand aims to define effectiveness of algorithmic trading, comparing with different benchmarks represented by several types of indexes. How big returns… (more)

Subjects/Keywords: Algorithmic trading; high-frequency trading; investment strategy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kiselev, I. (2012). Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index. (Thesis). Jönköping UniversityJönköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-19495

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

Kiselev, Ilya. “Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index.” 2012. Thesis, Jönköping UniversityJönköping University. Accessed September 19, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-19495.

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

MLA Handbook (7th Edition):

Kiselev, Ilya. “Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index.” 2012. Web. 19 Sep 2020.

Vancouver:

Kiselev I. Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index. [Internet] [Thesis]. Jönköping UniversityJönköping University; 2012. [cited 2020 Sep 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-19495.

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

Council of Science Editors:

Kiselev I. Can algorithmic trading beat the market? : An experiment with S&P 500, FTSE 100, OMX Stockholm 30 Index. [Thesis]. Jönköping UniversityJönköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-19495

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


Delft University of Technology

27. Luitse, S.J.J. (author). Deconstruction: A new construction method for prefabricated shell structures.

Degree: 2016, Delft University of Technology

Shell structures are expensive structures due to their extensive construction time and costs making them unpopular in spite of their material and structural efficiency. Temporary… (more)

Subjects/Keywords: deconstruction; algorithmic; construction optimization; structural design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luitse, S. J. J. (. (2016). Deconstruction: A new construction method for prefabricated shell structures. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:ec1f51d5-2e38-47ac-98ca-dc8045a94bd6

Chicago Manual of Style (16th Edition):

Luitse, S J J (author). “Deconstruction: A new construction method for prefabricated shell structures.” 2016. Masters Thesis, Delft University of Technology. Accessed September 19, 2020. http://resolver.tudelft.nl/uuid:ec1f51d5-2e38-47ac-98ca-dc8045a94bd6.

MLA Handbook (7th Edition):

Luitse, S J J (author). “Deconstruction: A new construction method for prefabricated shell structures.” 2016. Web. 19 Sep 2020.

Vancouver:

Luitse SJJ(. Deconstruction: A new construction method for prefabricated shell structures. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2020 Sep 19]. Available from: http://resolver.tudelft.nl/uuid:ec1f51d5-2e38-47ac-98ca-dc8045a94bd6.

Council of Science Editors:

Luitse SJJ(. Deconstruction: A new construction method for prefabricated shell structures. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:ec1f51d5-2e38-47ac-98ca-dc8045a94bd6


Delft University of Technology

28. Albeda, Laurien (author). Pass the ball: Designing accountability into the socio-technical context of algorithmic systems.

Degree: 2018, Delft University of Technology

Algorithms are all around us. Based on large amounts of data and through automated decision-making processes, they increasingly exercise power over us. As a way… (more)

Subjects/Keywords: Algorithmic accountability; V2G; Design-based research; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Albeda, L. (. (2018). Pass the ball: Designing accountability into the socio-technical context of algorithmic systems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:11f03580-0334-4051-bc14-b21fbb114d1e

Chicago Manual of Style (16th Edition):

Albeda, Laurien (author). “Pass the ball: Designing accountability into the socio-technical context of algorithmic systems.” 2018. Masters Thesis, Delft University of Technology. Accessed September 19, 2020. http://resolver.tudelft.nl/uuid:11f03580-0334-4051-bc14-b21fbb114d1e.

MLA Handbook (7th Edition):

Albeda, Laurien (author). “Pass the ball: Designing accountability into the socio-technical context of algorithmic systems.” 2018. Web. 19 Sep 2020.

Vancouver:

Albeda L(. Pass the ball: Designing accountability into the socio-technical context of algorithmic systems. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Sep 19]. Available from: http://resolver.tudelft.nl/uuid:11f03580-0334-4051-bc14-b21fbb114d1e.

Council of Science Editors:

Albeda L(. Pass the ball: Designing accountability into the socio-technical context of algorithmic systems. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:11f03580-0334-4051-bc14-b21fbb114d1e


University of Minnesota

29. Walker, Marcus. The Amazing Composobot: Music Information Retrieval and Algorithmic Composition.

Degree: MS, Mathematics, 2019, University of Minnesota

 Music has powerful and inscrutable effects on the human mind, and we are far from fully understanding how that magic works. But music is not… (more)

Subjects/Keywords: Algorithmic Composition; Markov; Music Information Retrieval

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Walker, M. (2019). The Amazing Composobot: Music Information Retrieval and Algorithmic Composition. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/208967

Chicago Manual of Style (16th Edition):

Walker, Marcus. “The Amazing Composobot: Music Information Retrieval and Algorithmic Composition.” 2019. Masters Thesis, University of Minnesota. Accessed September 19, 2020. http://hdl.handle.net/11299/208967.

MLA Handbook (7th Edition):

Walker, Marcus. “The Amazing Composobot: Music Information Retrieval and Algorithmic Composition.” 2019. Web. 19 Sep 2020.

Vancouver:

Walker M. The Amazing Composobot: Music Information Retrieval and Algorithmic Composition. [Internet] [Masters thesis]. University of Minnesota; 2019. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/11299/208967.

Council of Science Editors:

Walker M. The Amazing Composobot: Music Information Retrieval and Algorithmic Composition. [Masters Thesis]. University of Minnesota; 2019. Available from: http://hdl.handle.net/11299/208967


Lehigh University

30. Franczak, William Joseph. K-Triviality and Computable Measures.

Degree: PhD, Mathematics, 2019, Lehigh University

Algorithmic randomness is primarily concerned with quantifying the degree of randomness of infinite binary strings, and is usually carried out in the setting of Cantor… (more)

Subjects/Keywords: Algorithmic Randomness; K-trivial; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Franczak, W. J. (2019). K-Triviality and Computable Measures. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/5596

Chicago Manual of Style (16th Edition):

Franczak, William Joseph. “K-Triviality and Computable Measures.” 2019. Doctoral Dissertation, Lehigh University. Accessed September 19, 2020. https://preserve.lehigh.edu/etd/5596.

MLA Handbook (7th Edition):

Franczak, William Joseph. “K-Triviality and Computable Measures.” 2019. Web. 19 Sep 2020.

Vancouver:

Franczak WJ. K-Triviality and Computable Measures. [Internet] [Doctoral dissertation]. Lehigh University; 2019. [cited 2020 Sep 19]. Available from: https://preserve.lehigh.edu/etd/5596.

Council of Science Editors:

Franczak WJ. K-Triviality and Computable Measures. [Doctoral Dissertation]. Lehigh University; 2019. Available from: https://preserve.lehigh.edu/etd/5596

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

.