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

Dept: Computer Science

You searched for subject:(two stage stochastic programming). Showing records 1 – 30 of 518 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


Virginia Tech

1. Belal, Nahla Ahmed. Two Problems in Computational Genomics.

Degree: PhD, Computer Science, 2011, Virginia Tech

 This work addresses two novel problems in the field of computational genomics. The first is whole genome alignment and the second is inferring horizontal gene… (more)

Subjects/Keywords: horizontal gene transfer; Two Problems in Computational Genomics; whole genome alignment; dynamic programming; Graph theory; biology and genetics; graph algorithms; partial order sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Belal, N. A. (2011). Two Problems in Computational Genomics. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26318

Chicago Manual of Style (16th Edition):

Belal, Nahla Ahmed. “Two Problems in Computational Genomics.” 2011. Doctoral Dissertation, Virginia Tech. Accessed December 14, 2019. http://hdl.handle.net/10919/26318.

MLA Handbook (7th Edition):

Belal, Nahla Ahmed. “Two Problems in Computational Genomics.” 2011. Web. 14 Dec 2019.

Vancouver:

Belal NA. Two Problems in Computational Genomics. [Internet] [Doctoral dissertation]. Virginia Tech; 2011. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10919/26318.

Council of Science Editors:

Belal NA. Two Problems in Computational Genomics. [Doctoral Dissertation]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/26318

2. Bhat, Sooraj. Syntactic foundations for machine learning.

Degree: PhD, Computer Science, 2013, Georgia Tech

 Machine learning has risen in importance across science, engineering, and business in recent years. Domain experts have begun to understand how their data analysis problems… (more)

Subjects/Keywords: Probabilistic programming; Type theory; Formal languages; Probability; Optimization; Semantics; Machine learning; Stochastic models; Computer programming

…not feature more than two of them simultaneously: a b c d Programming languages… …two reformulations. . . . . . . . . . . . . . . . . . . 63 13 Schematic of switched flow… …97 17 EM for a mixture of two Gaussians. The function φ is the pdf of the normal… …languages, such as SQL, as well as languages for constraint programming. In this vein, there is… …Keeping these two incarnations of the model in synch is tedious and error-prone. Automation… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhat, S. (2013). Syntactic foundations for machine learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47700

Chicago Manual of Style (16th Edition):

Bhat, Sooraj. “Syntactic foundations for machine learning.” 2013. Doctoral Dissertation, Georgia Tech. Accessed December 14, 2019. http://hdl.handle.net/1853/47700.

MLA Handbook (7th Edition):

Bhat, Sooraj. “Syntactic foundations for machine learning.” 2013. Web. 14 Dec 2019.

Vancouver:

Bhat S. Syntactic foundations for machine learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1853/47700.

Council of Science Editors:

Bhat S. Syntactic foundations for machine learning. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47700

3. Rachlin, Eric E. Reliable Computing at the Nanoscale.

Degree: PhD, Computer Science, 2010, Brown University

 Photolithography allows millions of identical computer chips to be efficiently produced by repeatedly shining light through a set of masks. Since the 1960's, this process… (more)

Subjects/Keywords: Stochastic Assembly

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rachlin, E. E. (2010). Reliable Computing at the Nanoscale. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11105/

Chicago Manual of Style (16th Edition):

Rachlin, Eric E. “Reliable Computing at the Nanoscale.” 2010. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:11105/.

MLA Handbook (7th Edition):

Rachlin, Eric E. “Reliable Computing at the Nanoscale.” 2010. Web. 14 Dec 2019.

Vancouver:

Rachlin EE. Reliable Computing at the Nanoscale. [Internet] [Doctoral dissertation]. Brown University; 2010. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:11105/.

Council of Science Editors:

Rachlin EE. Reliable Computing at the Nanoscale. [Doctoral Dissertation]. Brown University; 2010. Available from: https://repository.library.brown.edu/studio/item/bdr:11105/

4. Mercier, Luc H. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.

Degree: PhD, Computer Science, 2009, Brown University

 Online stochastic combinatorial optimization problems are problems in which a decision maker is trying to minimize or maximize an objective by making a sequence of… (more)

Subjects/Keywords: stochastic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mercier, L. H. (2009). Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:95/

Chicago Manual of Style (16th Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:95/.

MLA Handbook (7th Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Web. 14 Dec 2019.

Vancouver:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:95/.

Council of Science Editors:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Doctoral Dissertation]. Brown University; 2009. Available from: https://repository.library.brown.edu/studio/item/bdr:95/


North Carolina State University

5. Hayward, Lauren Janece. Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course.

Degree: MS, Computer Science, 2009, North Carolina State University

 Pair programming is a style of programming in which two programmers work together on the same software artifact. Pair programming has many demonstrated benefits including… (more)

Subjects/Keywords: collaborative programming; distributed programming; pair programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hayward, L. J. (2009). Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1336

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

Hayward, Lauren Janece. “Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course.” 2009. Thesis, North Carolina State University. Accessed December 14, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1336.

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

MLA Handbook (7th Edition):

Hayward, Lauren Janece. “Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course.” 2009. Web. 14 Dec 2019.

Vancouver:

Hayward LJ. Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2019 Dec 14]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1336.

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

Council of Science Editors:

Hayward LJ. Students' Perceptions of Distributed Pair Programming in an Upper-Level Undergraduate Software Engineering Course. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1336

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


University of Minnesota

6. Pakanati, Anuraag. Swarm dispersion via leader election, potential fields, and counting hops.

Degree: MS, Computer Science, 2010, University of Minnesota

University of Minnesota M.S. thesis. March 2010. Major: Computer Science. Advisor: Maria Gini. 1 computer file (PDF); ix, 80 pages.

Robot swarm dispersion is an… (more)

Subjects/Keywords: Player/Stage framework; Robot swarm; Player/Stage environment; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pakanati, A. (2010). Swarm dispersion via leader election, potential fields, and counting hops. (Masters Thesis). University of Minnesota. Retrieved from http://purl.umn.edu/60742

Chicago Manual of Style (16th Edition):

Pakanati, Anuraag. “Swarm dispersion via leader election, potential fields, and counting hops.” 2010. Masters Thesis, University of Minnesota. Accessed December 14, 2019. http://purl.umn.edu/60742.

MLA Handbook (7th Edition):

Pakanati, Anuraag. “Swarm dispersion via leader election, potential fields, and counting hops.” 2010. Web. 14 Dec 2019.

Vancouver:

Pakanati A. Swarm dispersion via leader election, potential fields, and counting hops. [Internet] [Masters thesis]. University of Minnesota; 2010. [cited 2019 Dec 14]. Available from: http://purl.umn.edu/60742.

Council of Science Editors:

Pakanati A. Swarm dispersion via leader election, potential fields, and counting hops. [Masters Thesis]. University of Minnesota; 2010. Available from: http://purl.umn.edu/60742


University of Minnesota

7. Pakanati, Anuraag. Swarm dispersion via leader election, potential fields, and counting hops.

Degree: MS, Computer Science, 2010, University of Minnesota

 Robot swarm dispersion is an important area of research with many applications including the deployment of sensor networks for military, search and rescue, emergency response,… (more)

Subjects/Keywords: Player/Stage framework; Robot swarm; Player/Stage environment; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pakanati, A. (2010). Swarm dispersion via leader election, potential fields, and counting hops. (Masters Thesis). University of Minnesota. Retrieved from http://purl.umn.edu/60742

Chicago Manual of Style (16th Edition):

Pakanati, Anuraag. “Swarm dispersion via leader election, potential fields, and counting hops.” 2010. Masters Thesis, University of Minnesota. Accessed December 14, 2019. http://purl.umn.edu/60742.

MLA Handbook (7th Edition):

Pakanati, Anuraag. “Swarm dispersion via leader election, potential fields, and counting hops.” 2010. Web. 14 Dec 2019.

Vancouver:

Pakanati A. Swarm dispersion via leader election, potential fields, and counting hops. [Internet] [Masters thesis]. University of Minnesota; 2010. [cited 2019 Dec 14]. Available from: http://purl.umn.edu/60742.

Council of Science Editors:

Pakanati A. Swarm dispersion via leader election, potential fields, and counting hops. [Masters Thesis]. University of Minnesota; 2010. Available from: http://purl.umn.edu/60742


University of Georgia

8. Meyerson, Seth. Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils.

Degree: MS, Computer Science, 2015, University of Georgia

 Since the problem's formulation by Kautz in 1958 as an error detection tool, diverse applications for long snakes and coils have been found. These include… (more)

Subjects/Keywords: stochastic beam search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meyerson, S. (2015). Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/meyerson_seth_201505_ms

Chicago Manual of Style (16th Edition):

Meyerson, Seth. “Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils.” 2015. Masters Thesis, University of Georgia. Accessed December 14, 2019. http://purl.galileo.usg.edu/uga_etd/meyerson_seth_201505_ms.

MLA Handbook (7th Edition):

Meyerson, Seth. “Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils.” 2015. Web. 14 Dec 2019.

Vancouver:

Meyerson S. Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils. [Internet] [Masters thesis]. University of Georgia; 2015. [cited 2019 Dec 14]. Available from: http://purl.galileo.usg.edu/uga_etd/meyerson_seth_201505_ms.

Council of Science Editors:

Meyerson S. Finding longest paths in hypercubes: 11 new lower bounds for snakes, coils, and symmetrical coils. [Masters Thesis]. University of Georgia; 2015. Available from: http://purl.galileo.usg.edu/uga_etd/meyerson_seth_201505_ms


University of Georgia

9. Zhao, Zhe. Solo programming vs pair programming: strategies for debugging.

Degree: MS, Computer Science, 2014, University of Georgia

 Program debugging is a process to locate and fix the bugs or defects responsible for a symptom violation in a computer program, thus making it… (more)

Subjects/Keywords: pair programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Z. (2014). Solo programming vs pair programming: strategies for debugging. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/zhao_zhe_201408_ms

Chicago Manual of Style (16th Edition):

Zhao, Zhe. “Solo programming vs pair programming: strategies for debugging.” 2014. Masters Thesis, University of Georgia. Accessed December 14, 2019. http://purl.galileo.usg.edu/uga_etd/zhao_zhe_201408_ms.

MLA Handbook (7th Edition):

Zhao, Zhe. “Solo programming vs pair programming: strategies for debugging.” 2014. Web. 14 Dec 2019.

Vancouver:

Zhao Z. Solo programming vs pair programming: strategies for debugging. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Dec 14]. Available from: http://purl.galileo.usg.edu/uga_etd/zhao_zhe_201408_ms.

Council of Science Editors:

Zhao Z. Solo programming vs pair programming: strategies for debugging. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/zhao_zhe_201408_ms

10. Yip, Yue Kwen Justin. The Length-Lex Representation for Constraint Programming over Sets.

Degree: PhD, Computer Science, 2011, Brown University

 Constraint Programming is a declarative programming paradigm for solving hard combinatorial problems. Its model consists of a set of decision variables, and a set of… (more)

Subjects/Keywords: Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yip, Y. K. J. (2011). The Length-Lex Representation for Constraint Programming over Sets. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11342/

Chicago Manual of Style (16th Edition):

Yip, Yue Kwen Justin. “The Length-Lex Representation for Constraint Programming over Sets.” 2011. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:11342/.

MLA Handbook (7th Edition):

Yip, Yue Kwen Justin. “The Length-Lex Representation for Constraint Programming over Sets.” 2011. Web. 14 Dec 2019.

Vancouver:

Yip YKJ. The Length-Lex Representation for Constraint Programming over Sets. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:11342/.

Council of Science Editors:

Yip YKJ. The Length-Lex Representation for Constraint Programming over Sets. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11342/

11. Guha, Arjun. Semantics and Types for Safe Web Programming.

Degree: PhD, Computer Science, 2012, Brown University

 Web programs are distinct from traditional programs in two key ways. First, programs freely compose data and code from several sources. Second, the user often… (more)

Subjects/Keywords: programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guha, A. (2012). Semantics and Types for Safe Web Programming. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297608/

Chicago Manual of Style (16th Edition):

Guha, Arjun. “Semantics and Types for Safe Web Programming.” 2012. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:297608/.

MLA Handbook (7th Edition):

Guha, Arjun. “Semantics and Types for Safe Web Programming.” 2012. Web. 14 Dec 2019.

Vancouver:

Guha A. Semantics and Types for Safe Web Programming. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:297608/.

Council of Science Editors:

Guha A. Semantics and Types for Safe Web Programming. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297608/

12. Lev, Yossi. Debugging and Profiling of Transactional Programs.

Degree: PhD, Computer Science, 2010, Brown University

 Transactional memory (TM) has become increasingly popular in recent years as a promising programming paradigm for writing correct and scalable concurrent programs. Despite its popularity,… (more)

Subjects/Keywords: Concurrent programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lev, Y. (2010). Debugging and Profiling of Transactional Programs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11078/

Chicago Manual of Style (16th Edition):

Lev, Yossi. “Debugging and Profiling of Transactional Programs.” 2010. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:11078/.

MLA Handbook (7th Edition):

Lev, Yossi. “Debugging and Profiling of Transactional Programs.” 2010. Web. 14 Dec 2019.

Vancouver:

Lev Y. Debugging and Profiling of Transactional Programs. [Internet] [Doctoral dissertation]. Brown University; 2010. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:11078/.

Council of Science Editors:

Lev Y. Debugging and Profiling of Transactional Programs. [Doctoral Dissertation]. Brown University; 2010. Available from: https://repository.library.brown.edu/studio/item/bdr:11078/

13. Kadioglu, Serdar. Efficient Search Procedures for Solving Combinatorial Problems.

Degree: PhD, Computer Science, 2012, Brown University

 Solving combinatorial problems is an interplay between search and inference. In this thesis, we focus on search and investigate its important aspects. We start with… (more)

Subjects/Keywords: Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kadioglu, S. (2012). Efficient Search Procedures for Solving Combinatorial Problems. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297614/

Chicago Manual of Style (16th Edition):

Kadioglu, Serdar. “Efficient Search Procedures for Solving Combinatorial Problems.” 2012. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:297614/.

MLA Handbook (7th Edition):

Kadioglu, Serdar. “Efficient Search Procedures for Solving Combinatorial Problems.” 2012. Web. 14 Dec 2019.

Vancouver:

Kadioglu S. Efficient Search Procedures for Solving Combinatorial Problems. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:297614/.

Council of Science Editors:

Kadioglu S. Efficient Search Procedures for Solving Combinatorial Problems. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297614/


Vanderbilt University

14. Broll, Brian Daniel. Collaborative Educational Environment Design for Accessible Distributed Computing.

Degree: PhD, Computer Science, 2018, Vanderbilt University

 The pervasiveness of distributed applications in everyday life has made distributed computing concepts become part of basic computer literacy. The dissertation presents the design of… (more)

Subjects/Keywords: visual programming; computer science education; distributed programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Broll, B. D. (2018). Collaborative Educational Environment Design for Accessible Distributed Computing. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-03282018-090401/ ;

Chicago Manual of Style (16th Edition):

Broll, Brian Daniel. “Collaborative Educational Environment Design for Accessible Distributed Computing.” 2018. Doctoral Dissertation, Vanderbilt University. Accessed December 14, 2019. http://etd.library.vanderbilt.edu/available/etd-03282018-090401/ ;.

MLA Handbook (7th Edition):

Broll, Brian Daniel. “Collaborative Educational Environment Design for Accessible Distributed Computing.” 2018. Web. 14 Dec 2019.

Vancouver:

Broll BD. Collaborative Educational Environment Design for Accessible Distributed Computing. [Internet] [Doctoral dissertation]. Vanderbilt University; 2018. [cited 2019 Dec 14]. Available from: http://etd.library.vanderbilt.edu/available/etd-03282018-090401/ ;.

Council of Science Editors:

Broll BD. Collaborative Educational Environment Design for Accessible Distributed Computing. [Doctoral Dissertation]. Vanderbilt University; 2018. Available from: http://etd.library.vanderbilt.edu/available/etd-03282018-090401/ ;


University of Georgia

15. Ying, Yuchen. UnROP: creating correct backtrace from core dumps with stack pivoting.

Degree: MS, Computer Science, 2014, University of Georgia

 Return-oriented Programming (ROP) has become the most common way to exploit bugs in application, and stack pivoting is a common techniques for facilitating the attack.… (more)

Subjects/Keywords: Return-Oriented Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ying, Y. (2014). UnROP: creating correct backtrace from core dumps with stack pivoting. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/ying_yuchen_201408_ms

Chicago Manual of Style (16th Edition):

Ying, Yuchen. “UnROP: creating correct backtrace from core dumps with stack pivoting.” 2014. Masters Thesis, University of Georgia. Accessed December 14, 2019. http://purl.galileo.usg.edu/uga_etd/ying_yuchen_201408_ms.

MLA Handbook (7th Edition):

Ying, Yuchen. “UnROP: creating correct backtrace from core dumps with stack pivoting.” 2014. Web. 14 Dec 2019.

Vancouver:

Ying Y. UnROP: creating correct backtrace from core dumps with stack pivoting. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Dec 14]. Available from: http://purl.galileo.usg.edu/uga_etd/ying_yuchen_201408_ms.

Council of Science Editors:

Ying Y. UnROP: creating correct backtrace from core dumps with stack pivoting. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/ying_yuchen_201408_ms


Oregon State University

16. Zhang, Yan. Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts.

Degree: MS, Computer Science, 2011, Oregon State University

 Visual programming languages (VPLs) have been widely used to support end-user programming. However, end users are still not able to reuse code as actively as… (more)

Subjects/Keywords: end-user programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2011). Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/21408

Chicago Manual of Style (16th Edition):

Zhang, Yan. “Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts.” 2011. Masters Thesis, Oregon State University. Accessed December 14, 2019. http://hdl.handle.net/1957/21408.

MLA Handbook (7th Edition):

Zhang, Yan. “Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts.” 2011. Web. 14 Dec 2019.

Vancouver:

Zhang Y. Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts. [Internet] [Masters thesis]. Oregon State University; 2011. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1957/21408.

Council of Science Editors:

Zhang Y. Scratch Explorer : a tool for assisting end-user program comprehension of animation scripts. [Masters Thesis]. Oregon State University; 2011. Available from: http://hdl.handle.net/1957/21408


University of California – Santa Cruz

17. Schuster, Christopher. Towards Live Programming Environments for Statically Verified JavaScript.

Degree: Computer Science, 2018, University of California – Santa Cruz

 This dissertation includes contributions to both live programming and program verification and explores how programming environments can be designed to leverage benefits of both concepts… (more)

Subjects/Keywords: Computer science; JavaScript; Live Programming; Programming Environments; Programming Languages; Program Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schuster, C. (2018). Towards Live Programming Environments for Statically Verified JavaScript. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/6x85w65n

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

Schuster, Christopher. “Towards Live Programming Environments for Statically Verified JavaScript.” 2018. Thesis, University of California – Santa Cruz. Accessed December 14, 2019. http://www.escholarship.org/uc/item/6x85w65n.

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

MLA Handbook (7th Edition):

Schuster, Christopher. “Towards Live Programming Environments for Statically Verified JavaScript.” 2018. Web. 14 Dec 2019.

Vancouver:

Schuster C. Towards Live Programming Environments for Statically Verified JavaScript. [Internet] [Thesis]. University of California – Santa Cruz; 2018. [cited 2019 Dec 14]. Available from: http://www.escholarship.org/uc/item/6x85w65n.

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

Council of Science Editors:

Schuster C. Towards Live Programming Environments for Statically Verified JavaScript. [Thesis]. University of California – Santa Cruz; 2018. Available from: http://www.escholarship.org/uc/item/6x85w65n

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


Rutgers University

18. Goschin, Sergiu, 1980-. Stochastic dilemmas: foundations and applications.

Degree: Computer Science, 2014, Rutgers University

Subjects/Keywords: Stochastic processes; Stochastic analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goschin, Sergiu, 1. (2014). Stochastic dilemmas: foundations and applications. (Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/44107/

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

Goschin, Sergiu, 1980-. “Stochastic dilemmas: foundations and applications.” 2014. Thesis, Rutgers University. Accessed December 14, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/44107/.

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

MLA Handbook (7th Edition):

Goschin, Sergiu, 1980-. “Stochastic dilemmas: foundations and applications.” 2014. Web. 14 Dec 2019.

Vancouver:

Goschin, Sergiu 1. Stochastic dilemmas: foundations and applications. [Internet] [Thesis]. Rutgers University; 2014. [cited 2019 Dec 14]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44107/.

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

Council of Science Editors:

Goschin, Sergiu 1. Stochastic dilemmas: foundations and applications. [Thesis]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44107/

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


Portland State University

19. Morris, John Garrett. Type Classes and Instance Chains: A Relational Approach.

Degree: PhD, Computer Science, 2013, Portland State University

  Type classes, first proposed during the design of the Haskell programming language, extend standard type systems to support overloaded functions. Since their introduction, type… (more)

Subjects/Keywords: Functional programming languages; Haskell (Computer program language); Functional programming (Computer science); Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morris, J. G. (2013). Type Classes and Instance Chains: A Relational Approach. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/1010

Chicago Manual of Style (16th Edition):

Morris, John Garrett. “Type Classes and Instance Chains: A Relational Approach.” 2013. Doctoral Dissertation, Portland State University. Accessed December 14, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/1010.

MLA Handbook (7th Edition):

Morris, John Garrett. “Type Classes and Instance Chains: A Relational Approach.” 2013. Web. 14 Dec 2019.

Vancouver:

Morris JG. Type Classes and Instance Chains: A Relational Approach. [Internet] [Doctoral dissertation]. Portland State University; 2013. [cited 2019 Dec 14]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1010.

Council of Science Editors:

Morris JG. Type Classes and Instance Chains: A Relational Approach. [Doctoral Dissertation]. Portland State University; 2013. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/1010


University of Wisconsin – Milwaukee

20. Moctezuma, Antonio Pedro. The Effectiveness of Codesters in Teaching Basic Computer Science Topics.

Degree: MS, Computer Science, 2019, University of Wisconsin – Milwaukee

  Founded in 2014, Codesters is a visual programming environment (VPE) like the popular Scratch and Alice. Its goal is to teach middle school and… (more)

Subjects/Keywords: Block Programming; Codesters; K-12 Education; Visual Programming Environments; Visual Programming Languages; Education; Other Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moctezuma, A. P. (2019). The Effectiveness of Codesters in Teaching Basic Computer Science Topics. (Thesis). University of Wisconsin – Milwaukee. Retrieved from https://dc.uwm.edu/etd/2103

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

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Thesis, University of Wisconsin – Milwaukee. Accessed December 14, 2019. https://dc.uwm.edu/etd/2103.

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

MLA Handbook (7th Edition):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Web. 14 Dec 2019.

Vancouver:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Internet] [Thesis]. University of Wisconsin – Milwaukee; 2019. [cited 2019 Dec 14]. Available from: https://dc.uwm.edu/etd/2103.

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

Council of Science Editors:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Thesis]. University of Wisconsin – Milwaukee; 2019. Available from: https://dc.uwm.edu/etd/2103

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


University of Wisconsin – Milwaukee

21. Moctezuma, Antonio Pedro. The Effectiveness of Codesters in Teaching Basic Computer Science Topics.

Degree: MS, Computer Science, 2019, University of Wisconsin – Milwaukee

  Founded in 2014, Codesters is a visual programming environment (VPE) like the popular Scratch and Alice. Its goal is to teach middle school and… (more)

Subjects/Keywords: Block Programming; Codesters; K-12 Education; Visual Programming Environments; Visual Programming Languages; Education; Other Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moctezuma, A. P. (2019). The Effectiveness of Codesters in Teaching Basic Computer Science Topics. (Thesis). University of Wisconsin – Milwaukee. Retrieved from https://dc.uwm.edu/etd/2227

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

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Thesis, University of Wisconsin – Milwaukee. Accessed December 14, 2019. https://dc.uwm.edu/etd/2227.

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

MLA Handbook (7th Edition):

Moctezuma, Antonio Pedro. “The Effectiveness of Codesters in Teaching Basic Computer Science Topics.” 2019. Web. 14 Dec 2019.

Vancouver:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Internet] [Thesis]. University of Wisconsin – Milwaukee; 2019. [cited 2019 Dec 14]. Available from: https://dc.uwm.edu/etd/2227.

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

Council of Science Editors:

Moctezuma AP. The Effectiveness of Codesters in Teaching Basic Computer Science Topics. [Thesis]. University of Wisconsin – Milwaukee; 2019. Available from: https://dc.uwm.edu/etd/2227

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


University of Georgia

22. Wang, Hongyu. Parallel algorithms for image and video mosaic based applications.

Degree: MS, Computer Science, 2005, University of Georgia

 Image and video mosaic based applications have received growing interest in recent times. Image and video mosaicking techniques have been applied to various fields such… (more)

Subjects/Keywords: Parallel Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2005). Parallel algorithms for image and video mosaic based applications. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/wang_hongyu_200508_ms

Chicago Manual of Style (16th Edition):

Wang, Hongyu. “Parallel algorithms for image and video mosaic based applications.” 2005. Masters Thesis, University of Georgia. Accessed December 14, 2019. http://purl.galileo.usg.edu/uga_etd/wang_hongyu_200508_ms.

MLA Handbook (7th Edition):

Wang, Hongyu. “Parallel algorithms for image and video mosaic based applications.” 2005. Web. 14 Dec 2019.

Vancouver:

Wang H. Parallel algorithms for image and video mosaic based applications. [Internet] [Masters thesis]. University of Georgia; 2005. [cited 2019 Dec 14]. Available from: http://purl.galileo.usg.edu/uga_etd/wang_hongyu_200508_ms.

Council of Science Editors:

Wang H. Parallel algorithms for image and video mosaic based applications. [Masters Thesis]. University of Georgia; 2005. Available from: http://purl.galileo.usg.edu/uga_etd/wang_hongyu_200508_ms


Portland State University

23. Howard, Philip William. Extending Relativistic Programming to Multiple Writers.

Degree: PhD, Computer Science, 2012, Portland State University

  For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques that allow safe concurrency… (more)

Subjects/Keywords: Concurrency; Relativistic programming; Data structures; Synchronization; Multicore; Multiprocessors  – Programming; Systems programming (Computer science); Parallel programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Howard, P. W. (2012). Extending Relativistic Programming to Multiple Writers. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/114

Chicago Manual of Style (16th Edition):

Howard, Philip William. “Extending Relativistic Programming to Multiple Writers.” 2012. Doctoral Dissertation, Portland State University. Accessed December 14, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/114.

MLA Handbook (7th Edition):

Howard, Philip William. “Extending Relativistic Programming to Multiple Writers.” 2012. Web. 14 Dec 2019.

Vancouver:

Howard PW. Extending Relativistic Programming to Multiple Writers. [Internet] [Doctoral dissertation]. Portland State University; 2012. [cited 2019 Dec 14]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/114.

Council of Science Editors:

Howard PW. Extending Relativistic Programming to Multiple Writers. [Doctoral Dissertation]. Portland State University; 2012. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/114


Oregon State University

24. Dechow, Doug. Advanced separation of concerns and the compatibility of aspect-orientation.

Degree: PhD, Computer Science, 2005, Oregon State University

 The appropriate separation of concerns is a fundamental engineering principle. A concern, for software developers, is that which must be represented by code in a… (more)

Subjects/Keywords: Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dechow, D. (2005). Advanced separation of concerns and the compatibility of aspect-orientation. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/29757

Chicago Manual of Style (16th Edition):

Dechow, Doug. “Advanced separation of concerns and the compatibility of aspect-orientation.” 2005. Doctoral Dissertation, Oregon State University. Accessed December 14, 2019. http://hdl.handle.net/1957/29757.

MLA Handbook (7th Edition):

Dechow, Doug. “Advanced separation of concerns and the compatibility of aspect-orientation.” 2005. Web. 14 Dec 2019.

Vancouver:

Dechow D. Advanced separation of concerns and the compatibility of aspect-orientation. [Internet] [Doctoral dissertation]. Oregon State University; 2005. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1957/29757.

Council of Science Editors:

Dechow D. Advanced separation of concerns and the compatibility of aspect-orientation. [Doctoral Dissertation]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/29757


Oregon State University

25. Atwood, John Wesley. Culprit tracking : improved lazy marking for better GUI performance.

Degree: MS, Computer Science, 1996, Oregon State University

 Culprit Tracking is a technique to make lazy evaluation in a programming language even lazier. We sought to develop such a technique after noting poorly-distributed… (more)

Subjects/Keywords: Logic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Atwood, J. W. (1996). Culprit tracking : improved lazy marking for better GUI performance. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/34839

Chicago Manual of Style (16th Edition):

Atwood, John Wesley. “Culprit tracking : improved lazy marking for better GUI performance.” 1996. Masters Thesis, Oregon State University. Accessed December 14, 2019. http://hdl.handle.net/1957/34839.

MLA Handbook (7th Edition):

Atwood, John Wesley. “Culprit tracking : improved lazy marking for better GUI performance.” 1996. Web. 14 Dec 2019.

Vancouver:

Atwood JW. Culprit tracking : improved lazy marking for better GUI performance. [Internet] [Masters thesis]. Oregon State University; 1996. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1957/34839.

Council of Science Editors:

Atwood JW. Culprit tracking : improved lazy marking for better GUI performance. [Masters Thesis]. Oregon State University; 1996. Available from: http://hdl.handle.net/1957/34839


Oregon State University

26. Brown, Carol E. HELM, hierarchical environment for linear modeling.

Degree: PhD, Computer Science, 1989, Oregon State University

 Several problems relating to linear programming modeling have been identified: (1) model formulation, validation and explanation are difficult and time consuming; (2) models must be… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, C. E. (1989). HELM, hierarchical environment for linear modeling. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/38776

Chicago Manual of Style (16th Edition):

Brown, Carol E. “HELM, hierarchical environment for linear modeling.” 1989. Doctoral Dissertation, Oregon State University. Accessed December 14, 2019. http://hdl.handle.net/1957/38776.

MLA Handbook (7th Edition):

Brown, Carol E. “HELM, hierarchical environment for linear modeling.” 1989. Web. 14 Dec 2019.

Vancouver:

Brown CE. HELM, hierarchical environment for linear modeling. [Internet] [Doctoral dissertation]. Oregon State University; 1989. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/1957/38776.

Council of Science Editors:

Brown CE. HELM, hierarchical environment for linear modeling. [Doctoral Dissertation]. Oregon State University; 1989. Available from: http://hdl.handle.net/1957/38776


Virginia Tech

27. Hellmann, Jonathon David. DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language.

Degree: MS, Computer Science, 2015, Virginia Tech

 Block-based programming languages were originally designed for educational purposes. Due to their low requirements for a user's programming capability, such languages have great potential to… (more)

Subjects/Keywords: computer science; block-based programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hellmann, J. D. (2015). DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/54544

Chicago Manual of Style (16th Edition):

Hellmann, Jonathon David. “DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language.” 2015. Masters Thesis, Virginia Tech. Accessed December 14, 2019. http://hdl.handle.net/10919/54544.

MLA Handbook (7th Edition):

Hellmann, Jonathon David. “DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language.” 2015. Web. 14 Dec 2019.

Vancouver:

Hellmann JD. DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10919/54544.

Council of Science Editors:

Hellmann JD. DataSnap: Enabling Domain Experts and Introductory Programmers to Process Big Data in a Block-Based Programming Language. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/54544


California State University – Sacramento

28. Lin, Zhaoyan. Implementation of test run feature for PC2 web version.

Degree: MS, Computer Science, 2017, California State University – Sacramento

 This project is the implementation of Test Run, a test-run feature for the web version of PC2. PC2 is a programming contest control system developed… (more)

Subjects/Keywords: Programming; Contest; Control; System

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, Z. (2017). Implementation of test run feature for PC2 web version. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/198817

Chicago Manual of Style (16th Edition):

Lin, Zhaoyan. “Implementation of test run feature for PC2 web version.” 2017. Masters Thesis, California State University – Sacramento. Accessed December 14, 2019. http://hdl.handle.net/10211.3/198817.

MLA Handbook (7th Edition):

Lin, Zhaoyan. “Implementation of test run feature for PC2 web version.” 2017. Web. 14 Dec 2019.

Vancouver:

Lin Z. Implementation of test run feature for PC2 web version. [Internet] [Masters thesis]. California State University – Sacramento; 2017. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/10211.3/198817.

Council of Science Editors:

Lin Z. Implementation of test run feature for PC2 web version. [Masters Thesis]. California State University – Sacramento; 2017. Available from: http://hdl.handle.net/10211.3/198817


University of Illinois – Urbana-Champaign

29. Chen, Feng. Monitoring Oriented Programming and Analysis.

Degree: PhD, Computer Science, 2009, University of Illinois – Urbana-Champaign

Subjects/Keywords: Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, F. (2009). Monitoring Oriented Programming and Analysis. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/13620

Chicago Manual of Style (16th Edition):

Chen, Feng. “Monitoring Oriented Programming and Analysis.” 2009. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 14, 2019. http://hdl.handle.net/2142/13620.

MLA Handbook (7th Edition):

Chen, Feng. “Monitoring Oriented Programming and Analysis.” 2009. Web. 14 Dec 2019.

Vancouver:

Chen F. Monitoring Oriented Programming and Analysis. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2009. [cited 2019 Dec 14]. Available from: http://hdl.handle.net/2142/13620.

Council of Science Editors:

Chen F. Monitoring Oriented Programming and Analysis. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2009. Available from: http://hdl.handle.net/2142/13620

30. Cooper, Gregory Harold. Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language.

Degree: PhD, Computer Science, 2008, Brown University

 Dataflow programming provides an elegant model for computing with values that change over time. While many domain-specific dataflow languages have been developed, this dissertation presents… (more)

Subjects/Keywords: dataflow programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cooper, G. H. (2008). Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:268/

Chicago Manual of Style (16th Edition):

Cooper, Gregory Harold. “Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language.” 2008. Doctoral Dissertation, Brown University. Accessed December 14, 2019. https://repository.library.brown.edu/studio/item/bdr:268/.

MLA Handbook (7th Edition):

Cooper, Gregory Harold. “Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language.” 2008. Web. 14 Dec 2019.

Vancouver:

Cooper GH. Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language. [Internet] [Doctoral dissertation]. Brown University; 2008. [cited 2019 Dec 14]. Available from: https://repository.library.brown.edu/studio/item/bdr:268/.

Council of Science Editors:

Cooper GH. Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language. [Doctoral Dissertation]. Brown University; 2008. Available from: https://repository.library.brown.edu/studio/item/bdr:268/

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

.