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:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic). Showing records 1 – 30 of 814 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of California – Berkeley

1. Tulsiani, Madhur. Local Constraints in Combinatorial Optimization.

Degree: Computer Science, 2009, University of California – Berkeley

 Hard combinatorial optimization problems are often approximated using linear or semidefinite programming relaxations. In fact, most of the algorithms developed using such convex programs have… (more)

Subjects/Keywords: Computer Science; Approximation; Complexity; Convex Relaxations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tulsiani, M. (2009). Local Constraints in Combinatorial Optimization. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/70v2r675

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

Tulsiani, Madhur. “Local Constraints in Combinatorial Optimization.” 2009. Thesis, University of California – Berkeley. Accessed November 19, 2019. http://www.escholarship.org/uc/item/70v2r675.

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

MLA Handbook (7th Edition):

Tulsiani, Madhur. “Local Constraints in Combinatorial Optimization.” 2009. Web. 19 Nov 2019.

Vancouver:

Tulsiani M. Local Constraints in Combinatorial Optimization. [Internet] [Thesis]. University of California – Berkeley; 2009. [cited 2019 Nov 19]. Available from: http://www.escholarship.org/uc/item/70v2r675.

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

Council of Science Editors:

Tulsiani M. Local Constraints in Combinatorial Optimization. [Thesis]. University of California – Berkeley; 2009. Available from: http://www.escholarship.org/uc/item/70v2r675

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


University of Iowa

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Web. 19 Nov 2019.

Vancouver:

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

Council of Science Editors:

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


University of Illinois – Urbana-Champaign

3. Gupta, Shalmoli. Approximation algorithms for clustering and facility location problems.

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

 In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P… (more)

Subjects/Keywords: Approximation Algorithm; Clustering; Facility Location; Submodular function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, S. (2018). Approximation algorithms for clustering and facility location problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102419

Chicago Manual of Style (16th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed November 19, 2019. http://hdl.handle.net/2142/102419.

MLA Handbook (7th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 19 Nov 2019.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/2142/102419.

Council of Science Editors:

Gupta S. Approximation algorithms for clustering and facility location problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102419


Virginia Tech

4. Chen, Minghan. Stochastic Modeling and Simulation of Multiscale Biochemical Systems.

Degree: PhD, Computer Science, 2019, Virginia Tech

 Numerous challenges arise in modeling and simulation as biochemical networks are discovered with increasing complexities and unknown mechanisms. With the improvement in experimental techniques, biologists… (more)

Subjects/Keywords: Caulobacter cell cycle model; hybrid stochastic simulation algorithm; stochastic parameter optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, M. (2019). Stochastic Modeling and Simulation of Multiscale Biochemical Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/90898

Chicago Manual of Style (16th Edition):

Chen, Minghan. “Stochastic Modeling and Simulation of Multiscale Biochemical Systems.” 2019. Doctoral Dissertation, Virginia Tech. Accessed November 19, 2019. http://hdl.handle.net/10919/90898.

MLA Handbook (7th Edition):

Chen, Minghan. “Stochastic Modeling and Simulation of Multiscale Biochemical Systems.” 2019. Web. 19 Nov 2019.

Vancouver:

Chen M. Stochastic Modeling and Simulation of Multiscale Biochemical Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2019. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10919/90898.

Council of Science Editors:

Chen M. Stochastic Modeling and Simulation of Multiscale Biochemical Systems. [Doctoral Dissertation]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/90898


University of California – Berkeley

5. Wong, Chiu Wai. Optimization Everywhere: Convex, Combinatorial, and Economic.

Degree: Computer Science, 2018, University of California – Berkeley

 In this thesis we study fundamental problems that arise in optimization and its applications. We present provably efficient algorithms that achieve better running times or… (more)

Subjects/Keywords: Computer science; Mathematics; Operations research; Approximation Algorithms; Combinatorial Optimization; Convex Optimization; Market Equilibrium; Submodular Functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, C. W. (2018). Optimization Everywhere: Convex, Combinatorial, and Economic. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1f977832

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

Wong, Chiu Wai. “Optimization Everywhere: Convex, Combinatorial, and Economic.” 2018. Thesis, University of California – Berkeley. Accessed November 19, 2019. http://www.escholarship.org/uc/item/1f977832.

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

MLA Handbook (7th Edition):

Wong, Chiu Wai. “Optimization Everywhere: Convex, Combinatorial, and Economic.” 2018. Web. 19 Nov 2019.

Vancouver:

Wong CW. Optimization Everywhere: Convex, Combinatorial, and Economic. [Internet] [Thesis]. University of California – Berkeley; 2018. [cited 2019 Nov 19]. Available from: http://www.escholarship.org/uc/item/1f977832.

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

Council of Science Editors:

Wong CW. Optimization Everywhere: Convex, Combinatorial, and Economic. [Thesis]. University of California – Berkeley; 2018. Available from: http://www.escholarship.org/uc/item/1f977832

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


California State University – Sacramento

6. Banur Shashidhara, Divya. Using PSO algorithm for training neural networks.

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

 Artificial Neural Networks (ANN) have a wide range of applications in the field of science & technology. An attempt was made previously in a research… (more)

Subjects/Keywords: Artificial neural networks; CUDA programming; PSO algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Banur Shashidhara, D. (2016). Using PSO algorithm for training neural networks. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/171319

Chicago Manual of Style (16th Edition):

Banur Shashidhara, Divya. “Using PSO algorithm for training neural networks.” 2016. Masters Thesis, California State University – Sacramento. Accessed November 19, 2019. http://hdl.handle.net/10211.3/171319.

MLA Handbook (7th Edition):

Banur Shashidhara, Divya. “Using PSO algorithm for training neural networks.” 2016. Web. 19 Nov 2019.

Vancouver:

Banur Shashidhara D. Using PSO algorithm for training neural networks. [Internet] [Masters thesis]. California State University – Sacramento; 2016. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10211.3/171319.

Council of Science Editors:

Banur Shashidhara D. Using PSO algorithm for training neural networks. [Masters Thesis]. California State University – Sacramento; 2016. Available from: http://hdl.handle.net/10211.3/171319


University of California – Berkeley

7. Srivastava, Piyush. Counting and Correlation Decay in Spin Systems.

Degree: Computer Science, 2014, University of California – Berkeley

 Spin systems originated in statistical physics as tools for modeling phase transitions in magnets. However, they have since been used to model complex systems arising… (more)

Subjects/Keywords: Computer science; Mathematics; Approximation Algorithms; Computational Complexity; Counting; Decay of Correlations; Discrete Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srivastava, P. (2014). Counting and Correlation Decay in Spin Systems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7s73399j

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

Srivastava, Piyush. “Counting and Correlation Decay in Spin Systems.” 2014. Thesis, University of California – Berkeley. Accessed November 19, 2019. http://www.escholarship.org/uc/item/7s73399j.

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

MLA Handbook (7th Edition):

Srivastava, Piyush. “Counting and Correlation Decay in Spin Systems.” 2014. Web. 19 Nov 2019.

Vancouver:

Srivastava P. Counting and Correlation Decay in Spin Systems. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2019 Nov 19]. Available from: http://www.escholarship.org/uc/item/7s73399j.

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

Council of Science Editors:

Srivastava P. Counting and Correlation Decay in Spin Systems. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/7s73399j

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


Virginia Tech

8. Ahn, Tae-Hyuk. Computational Techniques for the Analysis of Large Scale Biological Systems.

Degree: PhD, Computer Science, 2016, Virginia Tech

 An accelerated pace of discovery in biological sciences is made possible by a new generation of computational biology and bioinformatics tools. In this dissertation we… (more)

Subjects/Keywords: Stochastic simulation algorithm (SSA); Parallel load balancing; Cell cycle; RNA-Sequencing; Stochastic differential equations (SDEs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahn, T. (2016). Computational Techniques for the Analysis of Large Scale Biological Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77162

Chicago Manual of Style (16th Edition):

Ahn, Tae-Hyuk. “Computational Techniques for the Analysis of Large Scale Biological Systems.” 2016. Doctoral Dissertation, Virginia Tech. Accessed November 19, 2019. http://hdl.handle.net/10919/77162.

MLA Handbook (7th Edition):

Ahn, Tae-Hyuk. “Computational Techniques for the Analysis of Large Scale Biological Systems.” 2016. Web. 19 Nov 2019.

Vancouver:

Ahn T. Computational Techniques for the Analysis of Large Scale Biological Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10919/77162.

Council of Science Editors:

Ahn T. Computational Techniques for the Analysis of Large Scale Biological Systems. [Doctoral Dissertation]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/77162


Clemson University

9. Chahal, Dheeraj. Automated, Parallel Optimization Algorithms for Stochastic Functions.

Degree: PhD, Computer Science, 2011, Clemson University

 The optimization algorithms for stochastic functions are desired specifically for real-world and simulation applications where results are obtained from sampling, and contain experimental error or… (more)

Subjects/Keywords: Algorithm; Automated; Optimization; Parallel; Simplex; Stochastic; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chahal, D. (2011). Automated, Parallel Optimization Algorithms for Stochastic Functions. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/706

Chicago Manual of Style (16th Edition):

Chahal, Dheeraj. “Automated, Parallel Optimization Algorithms for Stochastic Functions.” 2011. Doctoral Dissertation, Clemson University. Accessed November 19, 2019. https://tigerprints.clemson.edu/all_dissertations/706.

MLA Handbook (7th Edition):

Chahal, Dheeraj. “Automated, Parallel Optimization Algorithms for Stochastic Functions.” 2011. Web. 19 Nov 2019.

Vancouver:

Chahal D. Automated, Parallel Optimization Algorithms for Stochastic Functions. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Nov 19]. Available from: https://tigerprints.clemson.edu/all_dissertations/706.

Council of Science Editors:

Chahal D. Automated, Parallel Optimization Algorithms for Stochastic Functions. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/706


University of Illinois – Urbana-Champaign

10. Madan, Vivek. On approximability and LP formulations for multicut and feedback set problems.

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

 Graph cut algorithms are an important tool for solving optimization problems in a variety of areas in computer science. Of particular importance is the min… (more)

Subjects/Keywords: Approximation; Multicut; Feedback set; Linear programming relaxation; Hardness of approximation; Linear cut; Multiway cut; Subset feedback set; Flow-cut gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Madan, V. (2018). On approximability and LP formulations for multicut and feedback set problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102390

Chicago Manual of Style (16th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed November 19, 2019. http://hdl.handle.net/2142/102390.

MLA Handbook (7th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Web. 19 Nov 2019.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/2142/102390.

Council of Science Editors:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102390


Penn State University

11. Kasiviswanathan, Shiva Prasad. Approximation Algorithms For Graph Problems.

Degree: PhD, Computer Science, 2008, Penn State University

 This thesis studies approximation algorithms for two fundamental problems arising in graph theory: counting copies of one graph in another graph and estimating distances in… (more)

Subjects/Keywords: Geometric Disk Graph; Perfect Matching; Subgraph Isomorphism; Approximation Algorithm; Graph theory; Graph Spanner

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kasiviswanathan, S. P. (2008). Approximation Algorithms For Graph Problems. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8897

Chicago Manual of Style (16th Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Doctoral Dissertation, Penn State University. Accessed November 19, 2019. https://etda.libraries.psu.edu/catalog/8897.

MLA Handbook (7th Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Web. 19 Nov 2019.

Vancouver:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Nov 19]. Available from: https://etda.libraries.psu.edu/catalog/8897.

Council of Science Editors:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8897


University of Illinois – Urbana-Champaign

12. Patwa, Shweta Jayant. Survivable network design problems with element and vertex connectivity requirements.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 In this thesis, we consider degree-bounded element-connectivity Survivable Network Design Problem (Elem-SNDP) and degree-bounded Rooted k-outconnectivity Problem. We suggest bicriteria approximation algorithms that are motivated… (more)

Subjects/Keywords: Approximation algorithm; Network design; Bounded degree; Iterative rounding; Element connectivity; Node connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patwa, S. J. (2017). Survivable network design problems with element and vertex connectivity requirements. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98117

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

Patwa, Shweta Jayant. “Survivable network design problems with element and vertex connectivity requirements.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed November 19, 2019. http://hdl.handle.net/2142/98117.

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

MLA Handbook (7th Edition):

Patwa, Shweta Jayant. “Survivable network design problems with element and vertex connectivity requirements.” 2017. Web. 19 Nov 2019.

Vancouver:

Patwa SJ. Survivable network design problems with element and vertex connectivity requirements. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/2142/98117.

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

Council of Science Editors:

Patwa SJ. Survivable network design problems with element and vertex connectivity requirements. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98117

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


University of Iowa

13. Bhowmick, Santanu. Multi-covering problems and their variants.

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

  In combinatorial optimization, covering problems are those problems where given a ground set and a family of subsets of the ground set, the objective… (more)

Subjects/Keywords: approximation algorithm; clustering; computational geometry; geometric covering; multi cover; set cover; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhowmick, S. (2017). Multi-covering problems and their variants. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/5418

Chicago Manual of Style (16th Edition):

Bhowmick, Santanu. “Multi-covering problems and their variants.” 2017. Doctoral Dissertation, University of Iowa. Accessed November 19, 2019. https://ir.uiowa.edu/etd/5418.

MLA Handbook (7th Edition):

Bhowmick, Santanu. “Multi-covering problems and their variants.” 2017. Web. 19 Nov 2019.

Vancouver:

Bhowmick S. Multi-covering problems and their variants. [Internet] [Doctoral dissertation]. University of Iowa; 2017. [cited 2019 Nov 19]. Available from: https://ir.uiowa.edu/etd/5418.

Council of Science Editors:

Bhowmick S. Multi-covering problems and their variants. [Doctoral Dissertation]. University of Iowa; 2017. Available from: https://ir.uiowa.edu/etd/5418


Virginia Tech

14. Maji, Nabanita. An Interactive Tutorial for NP-Completeness.

Degree: MS, Computer Science, 2015, Virginia Tech

 A Theory of Algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be… (more)

Subjects/Keywords: NP Completeness; Complexity Theory; Reductions; Algorithm Visualization; Computer Science Education; Automated Assessment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maji, N. (2015). An Interactive Tutorial for NP-Completeness. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/52973

Chicago Manual of Style (16th Edition):

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Masters Thesis, Virginia Tech. Accessed November 19, 2019. http://hdl.handle.net/10919/52973.

MLA Handbook (7th Edition):

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Web. 19 Nov 2019.

Vancouver:

Maji N. An Interactive Tutorial for NP-Completeness. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10919/52973.

Council of Science Editors:

Maji N. An Interactive Tutorial for NP-Completeness. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/52973


Wayne State University

15. Rampersaud, Safraz. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.

Degree: PhD, Computer Science, 2016, Wayne State University

  Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a… (more)

Subjects/Keywords: approximation algorithms; multilinear programming; sharing-aware; vector bin-packing; vector knapsack; virtualization; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rampersaud, S. (2016). Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/1477

Chicago Manual of Style (16th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Doctoral Dissertation, Wayne State University. Accessed November 19, 2019. https://digitalcommons.wayne.edu/oa_dissertations/1477.

MLA Handbook (7th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Web. 19 Nov 2019.

Vancouver:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Internet] [Doctoral dissertation]. Wayne State University; 2016. [cited 2019 Nov 19]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477.

Council of Science Editors:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Doctoral Dissertation]. Wayne State University; 2016. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477


Penn State University

16. Malhotra, Raunaq. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.

Degree: PhD, Computer Science, 2016, Penn State University

 Next-generation sequencing (NGS) technologies have enabled fast profiling of diversity in population of closely related genomes over the past two decades in a high throughput… (more)

Subjects/Keywords: De novo assembly algorithms; viral population reconstruction; dynamic programming algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malhotra, R. (2016). De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/s1784k724

Chicago Manual of Style (16th Edition):

Malhotra, Raunaq. “De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.” 2016. Doctoral Dissertation, Penn State University. Accessed November 19, 2019. https://etda.libraries.psu.edu/catalog/s1784k724.

MLA Handbook (7th Edition):

Malhotra, Raunaq. “De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.” 2016. Web. 19 Nov 2019.

Vancouver:

Malhotra R. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2019 Nov 19]. Available from: https://etda.libraries.psu.edu/catalog/s1784k724.

Council of Science Editors:

Malhotra R. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/s1784k724


University of Manitoba

17. Page, Daniel. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.

Degree: Computer Science, 2014, University of Manitoba

 Let there be m parallel machines and n jobs to be scheduled non-preemptively. A job j scheduled on machine i takes pi,j time units to… (more)

Subjects/Keywords: theoretical computer science; approximation algorithms; algorithms; combinatorial optimization; computational complexity theory; makespan problem; scheduling; unrelated parallel machines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Page, D. (2014). Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23825

Chicago Manual of Style (16th Edition):

Page, Daniel. “Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.” 2014. Masters Thesis, University of Manitoba. Accessed November 19, 2019. http://hdl.handle.net/1993/23825.

MLA Handbook (7th Edition):

Page, Daniel. “Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.” 2014. Web. 19 Nov 2019.

Vancouver:

Page D. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. [Internet] [Masters thesis]. University of Manitoba; 2014. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/1993/23825.

Council of Science Editors:

Page D. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. [Masters Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23825


University of California – San Diego

18. Schneider, Stefan. Fine-Grained Connections Between Exponential and Polynomial Time.

Degree: Computer Science, 2017, University of California – San Diego

 This dissertation presents several results in fine-grained complexity. Fine-grained complexity aims at extending traditional complexity theory by making more precise, and fine-grained, statements on the… (more)

Subjects/Keywords: Computer science; Dynamic Programming; Fine-Grained Complexity; Satisfiability; Stable Matching; Strong Exponential Time Hypothesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schneider, S. (2017). Fine-Grained Connections Between Exponential and Polynomial Time. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/3rs5v3nc

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

Schneider, Stefan. “Fine-Grained Connections Between Exponential and Polynomial Time.” 2017. Thesis, University of California – San Diego. Accessed November 19, 2019. http://www.escholarship.org/uc/item/3rs5v3nc.

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

MLA Handbook (7th Edition):

Schneider, Stefan. “Fine-Grained Connections Between Exponential and Polynomial Time.” 2017. Web. 19 Nov 2019.

Vancouver:

Schneider S. Fine-Grained Connections Between Exponential and Polynomial Time. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2019 Nov 19]. Available from: http://www.escholarship.org/uc/item/3rs5v3nc.

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

Council of Science Editors:

Schneider S. Fine-Grained Connections Between Exponential and Polynomial Time. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/3rs5v3nc

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


Virginia Tech

19. Wang, Shuo. Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm.

Degree: PhD, Computer Science, 2016, Virginia Tech

Stochastic effects in cellular systems are usually modeled and simulated with Gillespie's stochastic simulation algorithm (SSA), which follows the same theoretical derivation as the chemical… (more)

Subjects/Keywords: hybrid stochastic simulation algorithm; linear chain reaction system; ordinary differential equation; cell cycle model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, S. (2016). Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/82717

Chicago Manual of Style (16th Edition):

Wang, Shuo. “Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm.” 2016. Doctoral Dissertation, Virginia Tech. Accessed November 19, 2019. http://hdl.handle.net/10919/82717.

MLA Handbook (7th Edition):

Wang, Shuo. “Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm.” 2016. Web. 19 Nov 2019.

Vancouver:

Wang S. Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10919/82717.

Council of Science Editors:

Wang S. Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm. [Doctoral Dissertation]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/82717


Virginia Tech

20. Gao, Guangyue. A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii.

Degree: MS, Computer Science, 2016, Virginia Tech

 Toxoplasma gondii (T. gondii) is an intracellular protozoan parasite. The parasite can infect all warm-blooded vertebrates. Up to 30% of the world's human population carry… (more)

Subjects/Keywords: Gillespie Algorithm; Toxoplasma Gondii; Finite Difference Method; Transmission Dynamics; Compartment-Based Model; Stochastic Simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, G. (2016). A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78106

Chicago Manual of Style (16th Edition):

Gao, Guangyue. “A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii.” 2016. Masters Thesis, Virginia Tech. Accessed November 19, 2019. http://hdl.handle.net/10919/78106.

MLA Handbook (7th Edition):

Gao, Guangyue. “A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii.” 2016. Web. 19 Nov 2019.

Vancouver:

Gao G. A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii. [Internet] [Masters thesis]. Virginia Tech; 2016. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/10919/78106.

Council of Science Editors:

Gao G. A Stochastic Model for The Transmission Dynamics of Toxoplasma Gondii. [Masters Thesis]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/78106


New Jersey Institute of Technology

21. Yun, Daqing. An integrated transport solution to big data movement in high-performance networks.

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

  Extreme-scale e-Science applications in various domains such as earth science and high energy physics among multiple national institutions within the U.S. are generating colossal… (more)

Subjects/Keywords: High-performance networking; Big data transfer; Transport profiling; Workflow optimization; Dedicated connections; Stochastic approximation; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yun, D. (2016). An integrated transport solution to big data movement in high-performance networks. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/84

Chicago Manual of Style (16th Edition):

Yun, Daqing. “An integrated transport solution to big data movement in high-performance networks.” 2016. Doctoral Dissertation, New Jersey Institute of Technology. Accessed November 19, 2019. https://digitalcommons.njit.edu/dissertations/84.

MLA Handbook (7th Edition):

Yun, Daqing. “An integrated transport solution to big data movement in high-performance networks.” 2016. Web. 19 Nov 2019.

Vancouver:

Yun D. An integrated transport solution to big data movement in high-performance networks. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2016. [cited 2019 Nov 19]. Available from: https://digitalcommons.njit.edu/dissertations/84.

Council of Science Editors:

Yun D. An integrated transport solution to big data movement in high-performance networks. [Doctoral Dissertation]. New Jersey Institute of Technology; 2016. Available from: https://digitalcommons.njit.edu/dissertations/84


Wayne State University

22. Dewan, Farhana. Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems.

Degree: PhD, Computer Science, 2014, Wayne State University

  Compositional real-time research has become one of the emerging trends in embedded and real-time systems due to the increasing scale and complexity of such… (more)

Subjects/Keywords: Admission Control; Approximation Algorithm; Compositional Real-Time Systems; Real-Time Interface; Resource Allocation; Slack Reclamation; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dewan, F. (2014). Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/880

Chicago Manual of Style (16th Edition):

Dewan, Farhana. “Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems.” 2014. Doctoral Dissertation, Wayne State University. Accessed November 19, 2019. https://digitalcommons.wayne.edu/oa_dissertations/880.

MLA Handbook (7th Edition):

Dewan, Farhana. “Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems.” 2014. Web. 19 Nov 2019.

Vancouver:

Dewan F. Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems. [Internet] [Doctoral dissertation]. Wayne State University; 2014. [cited 2019 Nov 19]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/880.

Council of Science Editors:

Dewan F. Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems. [Doctoral Dissertation]. Wayne State University; 2014. Available from: https://digitalcommons.wayne.edu/oa_dissertations/880


New Jersey Institute of Technology

23. Huo, Yumei. Some topics on deterministic scheduling problems.

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

  Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is… (more)

Subjects/Keywords: Scheduling; Online algorithm; Approximation algorithm; Dual criteria; NP-hard; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huo, Y. (2005). Some topics on deterministic scheduling problems. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/698

Chicago Manual of Style (16th Edition):

Huo, Yumei. “Some topics on deterministic scheduling problems.” 2005. Doctoral Dissertation, New Jersey Institute of Technology. Accessed November 19, 2019. https://digitalcommons.njit.edu/dissertations/698.

MLA Handbook (7th Edition):

Huo, Yumei. “Some topics on deterministic scheduling problems.” 2005. Web. 19 Nov 2019.

Vancouver:

Huo Y. Some topics on deterministic scheduling problems. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2005. [cited 2019 Nov 19]. Available from: https://digitalcommons.njit.edu/dissertations/698.

Council of Science Editors:

Huo Y. Some topics on deterministic scheduling problems. [Doctoral Dissertation]. New Jersey Institute of Technology; 2005. Available from: https://digitalcommons.njit.edu/dissertations/698


Lehigh University

24. Ruan, Wenjia. Accelerating Transactional Memory by Exploiting Platform Specificity.

Degree: PhD, Computer Science, 2015, Lehigh University

 Transactional Memory (TM) is one of the most promising alternatives to lock-based concurrency, but there still remain obstacles that keep TM from being utilized in… (more)

Subjects/Keywords: Algorithm; Concurrent Programming; Latency; Scalability; Synchronization; Transactional Memory; Computer Sciences; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruan, W. (2015). Accelerating Transactional Memory by Exploiting Platform Specificity. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2786

Chicago Manual of Style (16th Edition):

Ruan, Wenjia. “Accelerating Transactional Memory by Exploiting Platform Specificity.” 2015. Doctoral Dissertation, Lehigh University. Accessed November 19, 2019. https://preserve.lehigh.edu/etd/2786.

MLA Handbook (7th Edition):

Ruan, Wenjia. “Accelerating Transactional Memory by Exploiting Platform Specificity.” 2015. Web. 19 Nov 2019.

Vancouver:

Ruan W. Accelerating Transactional Memory by Exploiting Platform Specificity. [Internet] [Doctoral dissertation]. Lehigh University; 2015. [cited 2019 Nov 19]. Available from: https://preserve.lehigh.edu/etd/2786.

Council of Science Editors:

Ruan W. Accelerating Transactional Memory by Exploiting Platform Specificity. [Doctoral Dissertation]. Lehigh University; 2015. Available from: https://preserve.lehigh.edu/etd/2786


University of California – Berkeley

25. Weitz, Benjamin. Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy.

Degree: Computer Science, 2017, University of California – Berkeley

 Semidenite programming (SDP) relaxations have been a popular choice for approximationalgorithm design ever since Goemans and Williamson used one to improve the best approximationof Max-Cut… (more)

Subjects/Keywords: Computer science; Theoretical mathematics; Approximation Algorithms; Combinatorial Optimization; Polynomial Ideal Membership; Semidefinite Programming; Sum-of-Squares

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weitz, B. (2017). Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7sp6278f

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

Weitz, Benjamin. “Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy.” 2017. Thesis, University of California – Berkeley. Accessed November 19, 2019. http://www.escholarship.org/uc/item/7sp6278f.

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

MLA Handbook (7th Edition):

Weitz, Benjamin. “Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy.” 2017. Web. 19 Nov 2019.

Vancouver:

Weitz B. Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2019 Nov 19]. Available from: http://www.escholarship.org/uc/item/7sp6278f.

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

Council of Science Editors:

Weitz B. Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/7sp6278f

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


Linnaeus University

26. Bexell, Andreas. Comparing functional to imperative Java : with regards to readability, complexity and verbosity.

Degree: Computer Science, 2017, Linnaeus University

  Java has recently become a multi paradigm language, with the functional paradigmnow made available alongside the traditional, imperative, one. Programming in thefunctional paradigm may… (more)

Subjects/Keywords: software architecture; java; functional java; complexity; readability; verbosity; functional programming; Engineering and Technology; Teknik och teknologier

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bexell, A. (2017). Comparing functional to imperative Java : with regards to readability, complexity and verbosity. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-64712

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

Bexell, Andreas. “Comparing functional to imperative Java : with regards to readability, complexity and verbosity.” 2017. Thesis, Linnaeus University. Accessed November 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-64712.

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

MLA Handbook (7th Edition):

Bexell, Andreas. “Comparing functional to imperative Java : with regards to readability, complexity and verbosity.” 2017. Web. 19 Nov 2019.

Vancouver:

Bexell A. Comparing functional to imperative Java : with regards to readability, complexity and verbosity. [Internet] [Thesis]. Linnaeus University; 2017. [cited 2019 Nov 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-64712.

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

Council of Science Editors:

Bexell A. Comparing functional to imperative Java : with regards to readability, complexity and verbosity. [Thesis]. Linnaeus University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-64712

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


Rutgers University

27. Gupta, Mayank, 1990-. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.

Degree: MS, Computer Science, 2016, Rutgers University

 In this article we consider the problem of testing, for two nite sets of points in the Euclidean space, if their convex hulls are disjoint… (more)

Subjects/Keywords: Convex sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, Mayank, 1. (2016). A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

Chicago Manual of Style (16th Edition):

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Masters Thesis, Rutgers University. Accessed November 19, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

MLA Handbook (7th Edition):

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Web. 19 Nov 2019.

Vancouver:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Internet] [Masters thesis]. Rutgers University; 2016. [cited 2019 Nov 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

Council of Science Editors:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Masters Thesis]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/


University of Pretoria

28. Pampara, Gary. Angle modulated population based algorithms to solve binary problems.

Degree: Computer Science, 2012, University of Pretoria

 Recently, continuous-valued optimization problems have received a great amount of focus, resulting in optimization algorithms which are very efficient within the continuous-valued space. Many optimization… (more)

Subjects/Keywords: Angle modulation; Eolutionary programming; Genetic algorithm; Differential evolution; Particle swarm optimization (PSO); Atificial bee colony; Homomorphous mapping; Binary problem optimization; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pampara, G. (2012). Angle modulated population based algorithms to solve binary problems. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/22801

Chicago Manual of Style (16th Edition):

Pampara, Gary. “Angle modulated population based algorithms to solve binary problems.” 2012. Masters Thesis, University of Pretoria. Accessed November 19, 2019. http://hdl.handle.net/2263/22801.

MLA Handbook (7th Edition):

Pampara, Gary. “Angle modulated population based algorithms to solve binary problems.” 2012. Web. 19 Nov 2019.

Vancouver:

Pampara G. Angle modulated population based algorithms to solve binary problems. [Internet] [Masters thesis]. University of Pretoria; 2012. [cited 2019 Nov 19]. Available from: http://hdl.handle.net/2263/22801.

Council of Science Editors:

Pampara G. Angle modulated population based algorithms to solve binary problems. [Masters Thesis]. University of Pretoria; 2012. Available from: http://hdl.handle.net/2263/22801


Arizona State University

29. Lanus, Erin. Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization.

Degree: Computer Science, 2019, Arizona State University

Subjects/Keywords: Computer science; attribute-based access control; combinatorial testing; covering array; locating array; randomized algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lanus, E. (2019). Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/53676

Chicago Manual of Style (16th Edition):

Lanus, Erin. “Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization.” 2019. Doctoral Dissertation, Arizona State University. Accessed November 19, 2019. http://repository.asu.edu/items/53676.

MLA Handbook (7th Edition):

Lanus, Erin. “Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization.” 2019. Web. 19 Nov 2019.

Vancouver:

Lanus E. Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization. [Internet] [Doctoral dissertation]. Arizona State University; 2019. [cited 2019 Nov 19]. Available from: http://repository.asu.edu/items/53676.

Council of Science Editors:

Lanus E. Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization. [Doctoral Dissertation]. Arizona State University; 2019. Available from: http://repository.asu.edu/items/53676


University of Texas – Austin

30. -2178-1988. Program analysis techniques for algorithmic complexity and relational properties.

Degree: PhD, Computer Science, 2019, University of Texas – Austin

 Analyzing standard safety properties of a given program has traditionally been the primary focus of the program analysis community. Unfortunately, there are still many interesting… (more)

Subjects/Keywords: Complexity testing; Optimal program synthesis; Fuzzing; Genetic programming; Performance bug; Vulnerability detection; Side channel; Static analysis; Relational verification; Reinforcement learning; Policy gradient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-2178-1988. (2019). Program analysis techniques for algorithmic complexity and relational properties. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2181

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

Chicago Manual of Style (16th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed November 19, 2019. http://dx.doi.org/10.26153/tsw/2181.

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

MLA Handbook (7th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Web. 19 Nov 2019.

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

Vancouver:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2019 Nov 19]. Available from: http://dx.doi.org/10.26153/tsw/2181.

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

Council of Science Editors:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2181

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

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

.