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  Dates: 2000 – 2004

You searched for subject:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic). Showing records 1 – 30 of 38 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Georgia

1. Xing, Guangming. Generating NFA for efficient pattern matching.

Degree: PhD, Computer Science, 2001, University of Georgia

 Research in regular languages and their associated computational problems has been revitalized by the rapid development of the Internet and its applications. The construction of… (more)

Subjects/Keywords: Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xing, G. (2001). Generating NFA for efficient pattern matching. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd

Chicago Manual of Style (16th Edition):

Xing, Guangming. “Generating NFA for efficient pattern matching.” 2001. Doctoral Dissertation, University of Georgia. Accessed December 05, 2019. http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd.

MLA Handbook (7th Edition):

Xing, Guangming. “Generating NFA for efficient pattern matching.” 2001. Web. 05 Dec 2019.

Vancouver:

Xing G. Generating NFA for efficient pattern matching. [Internet] [Doctoral dissertation]. University of Georgia; 2001. [cited 2019 Dec 05]. Available from: http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd.

Council of Science Editors:

Xing G. Generating NFA for efficient pattern matching. [Doctoral Dissertation]. University of Georgia; 2001. Available from: http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd


University of Georgia

2. Zhong, Weiwei. Using traveling salesman problem algorithms to determine multiple sequence alignment orders.

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

 Multiple Sequence Alignment (MSA) is one of the most important tools in modern biology. The MSA problem is NP-hard, therefore, heuristic approaches are needed to… (more)

Subjects/Keywords: algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhong, W. (2003). Using traveling salesman problem algorithms to determine multiple sequence alignment orders. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms

Chicago Manual of Style (16th Edition):

Zhong, Weiwei. “Using traveling salesman problem algorithms to determine multiple sequence alignment orders.” 2003. Masters Thesis, University of Georgia. Accessed December 05, 2019. http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms.

MLA Handbook (7th Edition):

Zhong, Weiwei. “Using traveling salesman problem algorithms to determine multiple sequence alignment orders.” 2003. Web. 05 Dec 2019.

Vancouver:

Zhong W. Using traveling salesman problem algorithms to determine multiple sequence alignment orders. [Internet] [Masters thesis]. University of Georgia; 2003. [cited 2019 Dec 05]. Available from: http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms.

Council of Science Editors:

Zhong W. Using traveling salesman problem algorithms to determine multiple sequence alignment orders. [Masters Thesis]. University of Georgia; 2003. Available from: http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms


Virginia Tech

3. Saraiya, Purvi. Effective Features of Algorithm Visualizations.

Degree: MS, Computer Science, 2002, Virginia Tech

 Current research suggests that by actively involving students, you can increase pedagogical value of algorithm visualizations. We believe that a pedagogically successful visualization, besides actively… (more)

Subjects/Keywords: Pedagogical Effectiveness; Algorithm Visualization; Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saraiya, P. (2002). Effective Features of Algorithm Visualizations. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34654

Chicago Manual of Style (16th Edition):

Saraiya, Purvi. “Effective Features of Algorithm Visualizations.” 2002. Masters Thesis, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/34654.

MLA Handbook (7th Edition):

Saraiya, Purvi. “Effective Features of Algorithm Visualizations.” 2002. Web. 05 Dec 2019.

Vancouver:

Saraiya P. Effective Features of Algorithm Visualizations. [Internet] [Masters thesis]. Virginia Tech; 2002. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/34654.

Council of Science Editors:

Saraiya P. Effective Features of Algorithm Visualizations. [Masters Thesis]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/34654


Oregon State University

4. Arredondo-Castro, Miguel A. End-user programming in time : implementation and empirical studies.

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

 The temporal behavior in applications involving visual data can be critical for the correctness of some programs. Forms/3 allows the user to specify temporal behaviors… (more)

Subjects/Keywords: Visual programming languages (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arredondo-Castro, M. A. (2001). End-user programming in time : implementation and empirical studies. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/29577

Chicago Manual of Style (16th Edition):

Arredondo-Castro, Miguel A. “End-user programming in time : implementation and empirical studies.” 2001. Masters Thesis, Oregon State University. Accessed December 05, 2019. http://hdl.handle.net/1957/29577.

MLA Handbook (7th Edition):

Arredondo-Castro, Miguel A. “End-user programming in time : implementation and empirical studies.” 2001. Web. 05 Dec 2019.

Vancouver:

Arredondo-Castro MA. End-user programming in time : implementation and empirical studies. [Internet] [Masters thesis]. Oregon State University; 2001. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/1957/29577.

Council of Science Editors:

Arredondo-Castro MA. End-user programming in time : implementation and empirical studies. [Masters Thesis]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/29577


Oregon State University

5. Chekka, Sudheer Kumar. FAR : an end-user language to support cottage e-services.

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

 E-commerce has begun to evolve beyond simple web pages to more sophisticated ways of conducting e-business transactions, such as through electronic advertising, negotiation, and delivery.… (more)

Subjects/Keywords: Visual programming languages (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chekka, S. K. (2001). FAR : an end-user language to support cottage e-services. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/30987

Chicago Manual of Style (16th Edition):

Chekka, Sudheer Kumar. “FAR : an end-user language to support cottage e-services.” 2001. Masters Thesis, Oregon State University. Accessed December 05, 2019. http://hdl.handle.net/1957/30987.

MLA Handbook (7th Edition):

Chekka, Sudheer Kumar. “FAR : an end-user language to support cottage e-services.” 2001. Web. 05 Dec 2019.

Vancouver:

Chekka SK. FAR : an end-user language to support cottage e-services. [Internet] [Masters thesis]. Oregon State University; 2001. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/1957/30987.

Council of Science Editors:

Chekka SK. FAR : an end-user language to support cottage e-services. [Masters Thesis]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/30987


Oregon State University

6. Cao, Mingming. Automatic test case generation for spreadsheets.

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

 Test case generation in software testing is a process of developing a set of test data that satisfies a particular test adequacy criterion. It is… (more)

Subjects/Keywords: Programming languages (Electronic computers)  – Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cao, M. (2000). Automatic test case generation for spreadsheets. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/32777

Chicago Manual of Style (16th Edition):

Cao, Mingming. “Automatic test case generation for spreadsheets.” 2000. Masters Thesis, Oregon State University. Accessed December 05, 2019. http://hdl.handle.net/1957/32777.

MLA Handbook (7th Edition):

Cao, Mingming. “Automatic test case generation for spreadsheets.” 2000. Web. 05 Dec 2019.

Vancouver:

Cao M. Automatic test case generation for spreadsheets. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/1957/32777.

Council of Science Editors:

Cao M. Automatic test case generation for spreadsheets. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/32777


Oregon State University

7. Cao, Nanyu. Temporal programming in grid-oriented visual programming languages.

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

 Specifying varying speeds and temporal relationships is necessary when programming graphical animations, but support for temporal programming has usually been done by adding new language… (more)

Subjects/Keywords: Visual programming languages (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cao, N. (2000). Temporal programming in grid-oriented visual programming languages. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/33429

Chicago Manual of Style (16th Edition):

Cao, Nanyu. “Temporal programming in grid-oriented visual programming languages.” 2000. Masters Thesis, Oregon State University. Accessed December 05, 2019. http://hdl.handle.net/1957/33429.

MLA Handbook (7th Edition):

Cao, Nanyu. “Temporal programming in grid-oriented visual programming languages.” 2000. Web. 05 Dec 2019.

Vancouver:

Cao N. Temporal programming in grid-oriented visual programming languages. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/1957/33429.

Council of Science Editors:

Cao N. Temporal programming in grid-oriented visual programming languages. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/33429


North Carolina State University

8. George, Boby. Analysis and Quantification of Test Driven Development Approach.

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

 Software industry is increasingly becoming more demanding on development schedules and resources. Often, software production deals with ever-changing requirements and with development cycles measured in… (more)

Subjects/Keywords: testing; Extreme Programming; software methodologies; Software process; object oriented programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

George, B. (2002). Analysis and Quantification of Test Driven Development Approach. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2431

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

George, Boby. “Analysis and Quantification of Test Driven Development Approach.” 2002. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/2431.

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

MLA Handbook (7th Edition):

George, Boby. “Analysis and Quantification of Test Driven Development Approach.” 2002. Web. 05 Dec 2019.

Vancouver:

George B. Analysis and Quantification of Test Driven Development Approach. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2431.

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

Council of Science Editors:

George B. Analysis and Quantification of Test Driven Development Approach. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2431

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


Massey University

9. Cui, Xiangbiao. Evolution of the discrete transform using genetic programming.

Degree: Master, Computer Science, 2001, Massey University

 Image compression is an important method in image transmission, storage and manipulation. There are many successful techniques which have been developed. Most of these methods… (more)

Subjects/Keywords: Genetic programming (Computer science); Transformations (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cui, X. (2001). Evolution of the discrete transform using genetic programming. (Masters Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/10267

Chicago Manual of Style (16th Edition):

Cui, Xiangbiao. “Evolution of the discrete transform using genetic programming.” 2001. Masters Thesis, Massey University. Accessed December 05, 2019. http://hdl.handle.net/10179/10267.

MLA Handbook (7th Edition):

Cui, Xiangbiao. “Evolution of the discrete transform using genetic programming.” 2001. Web. 05 Dec 2019.

Vancouver:

Cui X. Evolution of the discrete transform using genetic programming. [Internet] [Masters thesis]. Massey University; 2001. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10179/10267.

Council of Science Editors:

Cui X. Evolution of the discrete transform using genetic programming. [Masters Thesis]. Massey University; 2001. Available from: http://hdl.handle.net/10179/10267


North Carolina State University

10. Wilson, Dylan Garrett. An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming.

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

 This work describes an experiment comparing knowledge sharing in two distinct team structures. Given the increasing importance of knowledge in the workplace, especially software engineering,… (more)

Subjects/Keywords: community of practice; agile programming methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilson, D. G. (2004). An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/365

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

Wilson, Dylan Garrett. “An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming.” 2004. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/365.

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

MLA Handbook (7th Edition):

Wilson, Dylan Garrett. “An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming.” 2004. Web. 05 Dec 2019.

Vancouver:

Wilson DG. An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming. [Internet] [Thesis]. North Carolina State University; 2004. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/365.

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

Council of Science Editors:

Wilson DG. An Empirical Study of the Tacit Knowledge Management Potential of Pair Programming. [Thesis]. North Carolina State University; 2004. Available from: http://www.lib.ncsu.edu/resolver/1840.16/365

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


University of Maine

11. Munden, Gilliad E. Concurrency Issues in Programmable Brick Languages.

Degree: MS, Computer Science, 2000, University of Maine

  Abstract The programmable brick constitutes a domain for simple, autonomous robotics geared towards novice programmers in a constructionist setting. A large number of languages… (more)

Subjects/Keywords: Computer programming; Children; Concurrency; LEGO programmable brick; Programming languages; Robots; Visible programming language; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Munden, G. E. (2000). Concurrency Issues in Programmable Brick Languages. (Masters Thesis). University of Maine. Retrieved from https://digitalcommons.library.umaine.edu/etd/220

Chicago Manual of Style (16th Edition):

Munden, Gilliad E. “Concurrency Issues in Programmable Brick Languages.” 2000. Masters Thesis, University of Maine. Accessed December 05, 2019. https://digitalcommons.library.umaine.edu/etd/220.

MLA Handbook (7th Edition):

Munden, Gilliad E. “Concurrency Issues in Programmable Brick Languages.” 2000. Web. 05 Dec 2019.

Vancouver:

Munden GE. Concurrency Issues in Programmable Brick Languages. [Internet] [Masters thesis]. University of Maine; 2000. [cited 2019 Dec 05]. Available from: https://digitalcommons.library.umaine.edu/etd/220.

Council of Science Editors:

Munden GE. Concurrency Issues in Programmable Brick Languages. [Masters Thesis]. University of Maine; 2000. Available from: https://digitalcommons.library.umaine.edu/etd/220

12. Andersson, Michael. Real-time rendering of large terrains using algorithms for continuous level of detail.

Degree: Computer Science, 2002, University of Skövde

  Three-dimensional computer graphics enjoys a wide range of applications of which games and movies are only few examples. By incorporating three-dimensional computer graphics in… (more)

Subjects/Keywords: real-time; rendering; terrain; algorithm; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andersson, M. (2002). Real-time rendering of large terrains using algorithms for continuous level of detail. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-638

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

Andersson, Michael. “Real-time rendering of large terrains using algorithms for continuous level of detail.” 2002. Thesis, University of Skövde. Accessed December 05, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-638.

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

MLA Handbook (7th Edition):

Andersson, Michael. “Real-time rendering of large terrains using algorithms for continuous level of detail.” 2002. Web. 05 Dec 2019.

Vancouver:

Andersson M. Real-time rendering of large terrains using algorithms for continuous level of detail. [Internet] [Thesis]. University of Skövde; 2002. [cited 2019 Dec 05]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-638.

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

Council of Science Editors:

Andersson M. Real-time rendering of large terrains using algorithms for continuous level of detail. [Thesis]. University of Skövde; 2002. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-638

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


Virginia Tech

13. Kodukula, Surya Ravikiran. An Adaptive Time Window Algorithm for Large Scale Network Emulation.

Degree: MS, Computer Science, 2002, Virginia Tech

 With the continuing growth of the Internet and network protocols, there is a need for Protocol Development Environments. Simulation environments like ns and OPNET require… (more)

Subjects/Keywords: Parallel Simulation; Time Window; Emulation; Optimistic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kodukula, S. R. (2002). An Adaptive Time Window Algorithm for Large Scale Network Emulation. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31160

Chicago Manual of Style (16th Edition):

Kodukula, Surya Ravikiran. “An Adaptive Time Window Algorithm for Large Scale Network Emulation.” 2002. Masters Thesis, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/31160.

MLA Handbook (7th Edition):

Kodukula, Surya Ravikiran. “An Adaptive Time Window Algorithm for Large Scale Network Emulation.” 2002. Web. 05 Dec 2019.

Vancouver:

Kodukula SR. An Adaptive Time Window Algorithm for Large Scale Network Emulation. [Internet] [Masters thesis]. Virginia Tech; 2002. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/31160.

Council of Science Editors:

Kodukula SR. An Adaptive Time Window Algorithm for Large Scale Network Emulation. [Masters Thesis]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/31160


North Carolina State University

14. Phadke, Priti. An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction.

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

 Auctions involve trading of variety of different items. Auctions that allow agents to bid for combinations of items are called Combinatorial Auctions (CAs). The Ascending… (more)

Subjects/Keywords: AkBA; Genetic Algorithm; Combinatorial Auctions; Bidding Strategies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phadke, P. (2002). An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1960

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

Phadke, Priti. “An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction.” 2002. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1960.

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

MLA Handbook (7th Edition):

Phadke, Priti. “An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction.” 2002. Web. 05 Dec 2019.

Vancouver:

Phadke P. An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1960.

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

Council of Science Editors:

Phadke P. An Evolutionary Approach to Finding Bidding Strategies in a Combinatorial Auction. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1960

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


Massey University

15. Leslie, Neil. Continuations and Martin-Löf's type theory.

Degree: PhD, Computer Science, 2000, Massey University

 M-LTT is a theory designed to formalize constructive mathematics. By appealing to the Curry-Howard 'propositions as types' analogy, and to the Brouwer-Heyting-Kolmogorov interpretation of intuitionistic… (more)

Subjects/Keywords: Functional programming; Type theory; Continuations; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leslie, N. (2000). Continuations and Martin-Löf's type theory. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/2456

Chicago Manual of Style (16th Edition):

Leslie, Neil. “Continuations and Martin-Löf's type theory.” 2000. Doctoral Dissertation, Massey University. Accessed December 05, 2019. http://hdl.handle.net/10179/2456.

MLA Handbook (7th Edition):

Leslie, Neil. “Continuations and Martin-Löf's type theory.” 2000. Web. 05 Dec 2019.

Vancouver:

Leslie N. Continuations and Martin-Löf's type theory. [Internet] [Doctoral dissertation]. Massey University; 2000. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10179/2456.

Council of Science Editors:

Leslie N. Continuations and Martin-Löf's type theory. [Doctoral Dissertation]. Massey University; 2000. Available from: http://hdl.handle.net/10179/2456


Virginia Tech

16. DePasquale III, Peter Joseph. Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments.

Degree: PhD, Computer Science, 2003, Virginia Tech

 The undergraduate Computer Science program at Virginia Tech is the largest in the Commonwealth of Virginia, of which a key component is ``CS 1044: Introduction… (more)

Subjects/Keywords: CS1; language subsets; programming environments; novice programmers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

DePasquale III, P. J. (2003). Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28367

Chicago Manual of Style (16th Edition):

DePasquale III, Peter Joseph. “Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments.” 2003. Doctoral Dissertation, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/28367.

MLA Handbook (7th Edition):

DePasquale III, Peter Joseph. “Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments.” 2003. Web. 05 Dec 2019.

Vancouver:

DePasquale III PJ. Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments. [Internet] [Doctoral dissertation]. Virginia Tech; 2003. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/28367.

Council of Science Editors:

DePasquale III PJ. Implications on the Learning of Programming Through the Implementation of Subsets in Program Development Environments. [Doctoral Dissertation]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/28367


Mississippi State University

17. Zhang, Yang. Dynamic Memory Management for the Loci Framework.

Degree: MS, Computer Science, 2004, Mississippi State University

 Resource management is a critical part in high-performance computing software. While management of processing resources to increase performance is the most critical, efficient management of… (more)

Subjects/Keywords: graph processing; parallel programming; declarative languages; software synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2004). Dynamic Memory Management for the Loci Framework. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;

Chicago Manual of Style (16th Edition):

Zhang, Yang. “Dynamic Memory Management for the Loci Framework.” 2004. Masters Thesis, Mississippi State University. Accessed December 05, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;.

MLA Handbook (7th Edition):

Zhang, Yang. “Dynamic Memory Management for the Loci Framework.” 2004. Web. 05 Dec 2019.

Vancouver:

Zhang Y. Dynamic Memory Management for the Loci Framework. [Internet] [Masters thesis]. Mississippi State University; 2004. [cited 2019 Dec 05]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;.

Council of Science Editors:

Zhang Y. Dynamic Memory Management for the Loci Framework. [Masters Thesis]. Mississippi State University; 2004. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-215627/ ;


North Carolina State University

18. Ramachandran, Vinay. An Extreme Programming (XP) Process Analysis and Project Management Tool.

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

 Increasingly, products in the software industry need to be delivered quickly to beat the competition. These products often have a dynamic and vague set of… (more)

Subjects/Keywords: Bryce; XP Tool; Extreme Programming; XP; Project management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramachandran, V. (2003). An Extreme Programming (XP) Process Analysis and Project Management Tool. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1724

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

Ramachandran, Vinay. “An Extreme Programming (XP) Process Analysis and Project Management Tool.” 2003. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1724.

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

MLA Handbook (7th Edition):

Ramachandran, Vinay. “An Extreme Programming (XP) Process Analysis and Project Management Tool.” 2003. Web. 05 Dec 2019.

Vancouver:

Ramachandran V. An Extreme Programming (XP) Process Analysis and Project Management Tool. [Internet] [Thesis]. North Carolina State University; 2003. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1724.

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

Council of Science Editors:

Ramachandran V. An Extreme Programming (XP) Process Analysis and Project Management Tool. [Thesis]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1724

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


North Carolina State University

19. Yang, Kai. Pairlearning in Undergraduate Computer Science Education, CS1 class.

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

 Anecdotal evidence in industry and academia has shown that pair programmers, whereby two programmers work collaboratively on the same task on one computer, can produce… (more)

Subjects/Keywords: Pair programming; active learning; pair learning; cooperative learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, K. (2002). Pairlearning in Undergraduate Computer Science Education, CS1 class. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/118

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

Yang, Kai. “Pairlearning in Undergraduate Computer Science Education, CS1 class.” 2002. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/118.

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

MLA Handbook (7th Edition):

Yang, Kai. “Pairlearning in Undergraduate Computer Science Education, CS1 class.” 2002. Web. 05 Dec 2019.

Vancouver:

Yang K. Pairlearning in Undergraduate Computer Science Education, CS1 class. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/118.

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

Council of Science Editors:

Yang K. Pairlearning in Undergraduate Computer Science Education, CS1 class. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/118

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


Virginia Tech

20. Seals, Cheryl Denise. A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations.

Degree: PhD, Computer Science, 2004, Virginia Tech

 Incorporating computers into daily K-12 classroom teaching promises to benefit student learning, and improve teaching practice substantially. Computer enhanced curricula may enable more teachers to… (more)

Subjects/Keywords: educational simulation; simulation creation; visual programming; reuse; minimalism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seals, C. D. (2004). A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28766

Chicago Manual of Style (16th Edition):

Seals, Cheryl Denise. “A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations.” 2004. Doctoral Dissertation, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/28766.

MLA Handbook (7th Edition):

Seals, Cheryl Denise. “A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations.” 2004. Web. 05 Dec 2019.

Vancouver:

Seals CD. A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations. [Internet] [Doctoral dissertation]. Virginia Tech; 2004. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/28766.

Council of Science Editors:

Seals CD. A framework for Learning and Reuse in Visual Programming Environments: Supporting Novice Programmer Development of Educational Simulations. [Doctoral Dissertation]. Virginia Tech; 2004. Available from: http://hdl.handle.net/10919/28766


Mississippi State University

21. Dandass, Yoginder Singh. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.

Degree: PhD, Computer Science, 2003, Mississippi State University

 Advanced architecture processors provide features such as caches and branch prediction that result in improved, but variable, execution time of software. Hard real-time systems require… (more)

Subjects/Keywords: list scheduling; probability distribution; directed acyclic graph; stochastic; real-time; genetic list scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dandass, Y. S. (2003). Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;

Chicago Manual of Style (16th Edition):

Dandass, Yoginder Singh. “Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.” 2003. Doctoral Dissertation, Mississippi State University. Accessed December 05, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;.

MLA Handbook (7th Edition):

Dandass, Yoginder Singh. “Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.” 2003. Web. 05 Dec 2019.

Vancouver:

Dandass YS. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. [Internet] [Doctoral dissertation]. Mississippi State University; 2003. [cited 2019 Dec 05]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;.

Council of Science Editors:

Dandass YS. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. [Doctoral Dissertation]. Mississippi State University; 2003. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;


Virginia Tech

22. Bora, Prachi Champalal. Runtime Algorithm Selection For Grid Environments: A Component Based Framework.

Degree: MS, Computer Science, 2003, Virginia Tech

 Grid environments are inherently heterogeneous. If the computational power provided by collaborations on the Grid is to be harnessed in the true sense, there is… (more)

Subjects/Keywords: Common Component Architecture; Linear Equations; Algorithm Selection; Grid Computing; Recommender Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bora, P. C. (2003). Runtime Algorithm Selection For Grid Environments: A Component Based Framework. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33823

Chicago Manual of Style (16th Edition):

Bora, Prachi Champalal. “Runtime Algorithm Selection For Grid Environments: A Component Based Framework.” 2003. Masters Thesis, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/33823.

MLA Handbook (7th Edition):

Bora, Prachi Champalal. “Runtime Algorithm Selection For Grid Environments: A Component Based Framework.” 2003. Web. 05 Dec 2019.

Vancouver:

Bora PC. Runtime Algorithm Selection For Grid Environments: A Component Based Framework. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/33823.

Council of Science Editors:

Bora PC. Runtime Algorithm Selection For Grid Environments: A Component Based Framework. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/33823


Portland State University

23. Johnson, Stephen Lee. TeaBag: A Debugger for Curry.

Degree: MS(M.S.) in Computer Science, Computer Science, 2004, Portland State University

  This thesis describes TeaBag, which is a debugger for functional logic computations. TeaBag is an accessory of a virtual machine currently under development. A… (more)

Subjects/Keywords: Debugging in computer science; Functional programming (Computer science); Functional programming languages; Computer Engineering; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, S. L. (2004). TeaBag: A Debugger for Curry. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/2663

Chicago Manual of Style (16th Edition):

Johnson, Stephen Lee. “TeaBag: A Debugger for Curry.” 2004. Masters Thesis, Portland State University. Accessed December 05, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/2663.

MLA Handbook (7th Edition):

Johnson, Stephen Lee. “TeaBag: A Debugger for Curry.” 2004. Web. 05 Dec 2019.

Vancouver:

Johnson SL. TeaBag: A Debugger for Curry. [Internet] [Masters thesis]. Portland State University; 2004. [cited 2019 Dec 05]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/2663.

Council of Science Editors:

Johnson SL. TeaBag: A Debugger for Curry. [Masters Thesis]. Portland State University; 2004. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/2663


North Carolina State University

24. Shukla, Anuja. Pair Programming and the Factors Affecting Brooks' Law.

Degree: M, Computer Science, 2002, North Carolina State University

 Frederick Brooks states in his book The Mythical Man-Month, "Adding manpower to a late software project makes it later." Brooks explains that often software development… (more)

Subjects/Keywords: pair rotation; stutzke's mathematical model; assimilation time; mentoring time; Brooks' Law; intercommunication time; Pair programming; extreme programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shukla, A. (2002). Pair Programming and the Factors Affecting Brooks' Law. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2328

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

Shukla, Anuja. “Pair Programming and the Factors Affecting Brooks' Law.” 2002. Thesis, North Carolina State University. Accessed December 05, 2019. http://www.lib.ncsu.edu/resolver/1840.16/2328.

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

MLA Handbook (7th Edition):

Shukla, Anuja. “Pair Programming and the Factors Affecting Brooks' Law.” 2002. Web. 05 Dec 2019.

Vancouver:

Shukla A. Pair Programming and the Factors Affecting Brooks' Law. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Dec 05]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2328.

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

Council of Science Editors:

Shukla A. Pair Programming and the Factors Affecting Brooks' Law. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2328

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

25. Svensson, Daniel. Generaliseringsförmåga vid genetisk programmering.

Degree: Computer Science, 2003, University of Skövde

  I detta arbete undersöks hur bestraffningsmetoder för att bestraffa storleken på GP-program påverkar generaliseringsförmågan. Arbetet grundar sig på ett arbete som Cavaretta och Chellapilla… (more)

Subjects/Keywords: Genetisk Programmering; Generalisering; Complexity parsimony pressure; Adaptive parsimony pressure; Penalty functions; Bloat; Information Systems; Systemvetenskap, informationssystem och informatik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Svensson, D. (2003). Generaliseringsförmåga vid genetisk programmering. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-789

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

Svensson, Daniel. “Generaliseringsförmåga vid genetisk programmering.” 2003. Thesis, University of Skövde. Accessed December 05, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-789.

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

MLA Handbook (7th Edition):

Svensson, Daniel. “Generaliseringsförmåga vid genetisk programmering.” 2003. Web. 05 Dec 2019.

Vancouver:

Svensson D. Generaliseringsförmåga vid genetisk programmering. [Internet] [Thesis]. University of Skövde; 2003. [cited 2019 Dec 05]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-789.

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

Council of Science Editors:

Svensson D. Generaliseringsförmåga vid genetisk programmering. [Thesis]. University of Skövde; 2003. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-789

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


Virginia Tech

26. Ramaraj, Sharath. Supporting Quality of Service in Distributed Virtual Environments.

Degree: MS, Computer Science, 2003, Virginia Tech

 We present a resource allocation perspective to Quality of Service in Distributed Virtual Environments. The user of a DVE system will have improved Quality of… (more)

Subjects/Keywords: Quality of Service(QoS); Neural Networks; Real-time; Distributed Virtual Environments; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramaraj, S. (2003). Supporting Quality of Service in Distributed Virtual Environments. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/35401

Chicago Manual of Style (16th Edition):

Ramaraj, Sharath. “Supporting Quality of Service in Distributed Virtual Environments.” 2003. Masters Thesis, Virginia Tech. Accessed December 05, 2019. http://hdl.handle.net/10919/35401.

MLA Handbook (7th Edition):

Ramaraj, Sharath. “Supporting Quality of Service in Distributed Virtual Environments.” 2003. Web. 05 Dec 2019.

Vancouver:

Ramaraj S. Supporting Quality of Service in Distributed Virtual Environments. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Dec 05]. Available from: http://hdl.handle.net/10919/35401.

Council of Science Editors:

Ramaraj S. Supporting Quality of Service in Distributed Virtual Environments. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/35401

27. Cherinka, Robert David. Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions.

Degree: PhD, Computer Science, 2000, Old Dominion University

  Traditional static code analysis encompasses a mature set of techniques for helping understand and optimize programs, such as dead code elimination, program slicing, and… (more)

Subjects/Keywords: Component-based solutions; Static analysis techniques; Programming Languages and Compilers; Systems Architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cherinka, R. D. (2000). Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions. (Doctoral Dissertation). Old Dominion University. Retrieved from 9780493079066 ; https://digitalcommons.odu.edu/computerscience_etds/73

Chicago Manual of Style (16th Edition):

Cherinka, Robert David. “Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions.” 2000. Doctoral Dissertation, Old Dominion University. Accessed December 05, 2019. 9780493079066 ; https://digitalcommons.odu.edu/computerscience_etds/73.

MLA Handbook (7th Edition):

Cherinka, Robert David. “Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions.” 2000. Web. 05 Dec 2019.

Vancouver:

Cherinka RD. Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions. [Internet] [Doctoral dissertation]. Old Dominion University; 2000. [cited 2019 Dec 05]. Available from: 9780493079066 ; https://digitalcommons.odu.edu/computerscience_etds/73.

Council of Science Editors:

Cherinka RD. Extending Traditional Static Analysis Techniques to Support Development, Testing and Maintenance of Component-Based Solutions. [Doctoral Dissertation]. Old Dominion University; 2000. Available from: 9780493079066 ; https://digitalcommons.odu.edu/computerscience_etds/73

28. Mohamed, Emad Eldin Mohamed. Multicast Services for Multimedia Collaborative Applications.

Degree: PhD, Computer Science, 2000, Old Dominion University

  This work aims at providing multicast services for multimedia collaborative applications over large inter-networks such as the Internet. Multimedia collaborative applications are typically of… (more)

Subjects/Keywords: Collaborative; Internet; Multicast; Multimedia; Networks; Digital Communications and Networking; Programming Languages and Compilers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohamed, E. E. M. (2000). Multicast Services for Multimedia Collaborative Applications. (Doctoral Dissertation). Old Dominion University. Retrieved from 9780599965645 ; https://digitalcommons.odu.edu/computerscience_etds/74

Chicago Manual of Style (16th Edition):

Mohamed, Emad Eldin Mohamed. “Multicast Services for Multimedia Collaborative Applications.” 2000. Doctoral Dissertation, Old Dominion University. Accessed December 05, 2019. 9780599965645 ; https://digitalcommons.odu.edu/computerscience_etds/74.

MLA Handbook (7th Edition):

Mohamed, Emad Eldin Mohamed. “Multicast Services for Multimedia Collaborative Applications.” 2000. Web. 05 Dec 2019.

Vancouver:

Mohamed EEM. Multicast Services for Multimedia Collaborative Applications. [Internet] [Doctoral dissertation]. Old Dominion University; 2000. [cited 2019 Dec 05]. Available from: 9780599965645 ; https://digitalcommons.odu.edu/computerscience_etds/74.

Council of Science Editors:

Mohamed EEM. Multicast Services for Multimedia Collaborative Applications. [Doctoral Dissertation]. Old Dominion University; 2000. Available from: 9780599965645 ; https://digitalcommons.odu.edu/computerscience_etds/74


New Jersey Institute of Technology

29. Chen, Yaofei. Programming language trends : an empirical study.

Degree: PhD, Computer Science, 2003, New Jersey Institute of Technology

  Predicting the evolution of software engineering technology trends is a dubious proposition. The recent evolution of software technology is a prime example; it is… (more)

Subjects/Keywords: Programming language; Software engineering; Empirical study; Computer science; Statistics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2003). Programming language trends : an empirical study. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/587

Chicago Manual of Style (16th Edition):

Chen, Yaofei. “Programming language trends : an empirical study.” 2003. Doctoral Dissertation, New Jersey Institute of Technology. Accessed December 05, 2019. https://digitalcommons.njit.edu/dissertations/587.

MLA Handbook (7th Edition):

Chen, Yaofei. “Programming language trends : an empirical study.” 2003. Web. 05 Dec 2019.

Vancouver:

Chen Y. Programming language trends : an empirical study. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2003. [cited 2019 Dec 05]. Available from: https://digitalcommons.njit.edu/dissertations/587.

Council of Science Editors:

Chen Y. Programming language trends : an empirical study. [Doctoral Dissertation]. New Jersey Institute of Technology; 2003. Available from: https://digitalcommons.njit.edu/dissertations/587

30. Thorstensson, Niklas. A knowledge-based grapheme-to-phoneme conversion for Swedish.

Degree: Computer Science, 2002, University of Skövde

  A text-to-speech system is a complex system consisting of several different modules such as grapheme-to-phoneme conversion, articulatory and prosodic modelling, voice modelling etc. This… (more)

Subjects/Keywords: Grapheme-to-Phoneme; algorithm; Text-to-speech; Swedish; Information Systems; Systemvetenskap, informationssystem och informatik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thorstensson, N. (2002). A knowledge-based grapheme-to-phoneme conversion for Swedish. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-731

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

Thorstensson, Niklas. “A knowledge-based grapheme-to-phoneme conversion for Swedish.” 2002. Thesis, University of Skövde. Accessed December 05, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-731.

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

MLA Handbook (7th Edition):

Thorstensson, Niklas. “A knowledge-based grapheme-to-phoneme conversion for Swedish.” 2002. Web. 05 Dec 2019.

Vancouver:

Thorstensson N. A knowledge-based grapheme-to-phoneme conversion for Swedish. [Internet] [Thesis]. University of Skövde; 2002. [cited 2019 Dec 05]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-731.

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

Council of Science Editors:

Thorstensson N. A knowledge-based grapheme-to-phoneme conversion for Swedish. [Thesis]. University of Skövde; 2002. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-731

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

[1] [2]

.