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  Level: doctoral

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

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

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Iowa

1. 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 December 12, 2019. https://ir.uiowa.edu/etd/870.

MLA Handbook (7th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Web. 12 Dec 2019.

Vancouver:

Pandit S. Approximation algorithms for distributed systems. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 Dec 12]. 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

2. 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 December 12, 2019. http://hdl.handle.net/2142/102419.

MLA Handbook (7th Edition):

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

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Dec 12]. 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

3. 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 December 12, 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. 12 Dec 2019.

Vancouver:

Ahn T. Computational Techniques for the Analysis of Large Scale Biological Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2019 Dec 12]. 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

4. 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 December 12, 2019. https://tigerprints.clemson.edu/all_dissertations/706.

MLA Handbook (7th Edition):

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

Vancouver:

Chahal D. Automated, Parallel Optimization Algorithms for Stochastic Functions. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Dec 12]. 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

5. 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 December 12, 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. 12 Dec 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 Dec 12]. 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

6. 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 December 12, 2019. https://etda.libraries.psu.edu/catalog/8897.

MLA Handbook (7th Edition):

Kasiviswanathan, Shiva Prasad. “Approximation Algorithms For Graph Problems.” 2008. Web. 12 Dec 2019.

Vancouver:

Kasiviswanathan SP. Approximation Algorithms For Graph Problems. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Dec 12]. 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 Iowa

7. 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 December 12, 2019. https://ir.uiowa.edu/etd/5418.

MLA Handbook (7th Edition):

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

Vancouver:

Bhowmick S. Multi-covering problems and their variants. [Internet] [Doctoral dissertation]. University of Iowa; 2017. [cited 2019 Dec 12]. 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


Wayne State University

8. 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 December 12, 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. 12 Dec 2019.

Vancouver:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Internet] [Doctoral dissertation]. Wayne State University; 2016. [cited 2019 Dec 12]. 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

9. 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 December 12, 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. 12 Dec 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 Dec 12]. 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


Virginia Tech

10. 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 December 12, 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. 12 Dec 2019.

Vancouver:

Wang S. Analysis and Application of Haseltine and Rawlings's Hybrid Stochastic Simulation Algorithm. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2019 Dec 12]. 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


New Jersey Institute of Technology

11. 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 December 12, 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. 12 Dec 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 Dec 12]. 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

12. 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 December 12, 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. 12 Dec 2019.

Vancouver:

Dewan F. Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems. [Internet] [Doctoral dissertation]. Wayne State University; 2014. [cited 2019 Dec 12]. 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

13. 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 December 12, 2019. https://digitalcommons.njit.edu/dissertations/698.

MLA Handbook (7th Edition):

Huo, Yumei. “Some topics on deterministic scheduling problems.” 2005. Web. 12 Dec 2019.

Vancouver:

Huo Y. Some topics on deterministic scheduling problems. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2005. [cited 2019 Dec 12]. 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

14. 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 December 12, 2019. https://preserve.lehigh.edu/etd/2786.

MLA Handbook (7th Edition):

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

Vancouver:

Ruan W. Accelerating Transactional Memory by Exploiting Platform Specificity. [Internet] [Doctoral dissertation]. Lehigh University; 2015. [cited 2019 Dec 12]. 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


Arizona State University

15. 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 December 12, 2019. http://repository.asu.edu/items/53676.

MLA Handbook (7th Edition):

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

Vancouver:

Lanus E. Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization. [Internet] [Doctoral dissertation]. Arizona State University; 2019. [cited 2019 Dec 12]. 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

16. -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 December 12, 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. 12 Dec 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 Dec 12]. 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

17. Huq, Arefin. The Complexity of Extended Formulations.

Degree: PhD, Computer Science, 2016, Georgia Tech

 Combinatorial optimization plays a central role in complexity theory, operations research, and algorithms. Extended formulations give a powerful approach to solve combinatorial optimization problems: if… (more)

Subjects/Keywords: Computational complexity; Combinatorial optimization; Extended formulations; Symmetry; Semidefinite programming; Copositive programming; Matching problem; Traveling salesperson problem

…conic hull of X 28 conv X the convex hull of X 28 Cn the cone of n × n copositive matrices 33… …vertices of P 30 xiii SUMMARY Combinatorial optimization plays a central role in complexity… …the possible solutions to a problem then one can use convex optimization to solve the… …problem has a small semidefinite extended formulation, since semidefinite programming… …generalizes linear programming. We show that the answer is no if the formulation is also required to… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huq, A. (2016). The Complexity of Extended Formulations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55556

Chicago Manual of Style (16th Edition):

Huq, Arefin. “The Complexity of Extended Formulations.” 2016. Doctoral Dissertation, Georgia Tech. Accessed December 12, 2019. http://hdl.handle.net/1853/55556.

MLA Handbook (7th Edition):

Huq, Arefin. “The Complexity of Extended Formulations.” 2016. Web. 12 Dec 2019.

Vancouver:

Huq A. The Complexity of Extended Formulations. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1853/55556.

Council of Science Editors:

Huq A. The Complexity of Extended Formulations. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55556


Rutgers University

18. Lutz, Neil J. Algorithmic information, fractal geometry, and distributed dynamics.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation applies two distinct algorithmic perspectives to questions in the field of fractal geometry and dynamics. In Part I, we establish connections between algorithmic… (more)

Subjects/Keywords: Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lutz, N. J. (2017). Algorithmic information, fractal geometry, and distributed dynamics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

Chicago Manual of Style (16th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Doctoral Dissertation, Rutgers University. Accessed December 12, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

MLA Handbook (7th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Web. 12 Dec 2019.

Vancouver:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2019 Dec 12]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

Council of Science Editors:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/


New Jersey Institute of Technology

19. Liu, Jianghui. RNA structure analysis : algorithms and applications.

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

  In this doctoral thesis, efficient algorithms for aligning RNA secondary structures and mining unknown RNA motifs are presented. As the major contribution, a structure… (more)

Subjects/Keywords: RNA Structure; Algorithm; RNA Motif; Bioinformatics; Dynamic programming; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, J. (2005). RNA structure analysis : algorithms and applications. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/730

Chicago Manual of Style (16th Edition):

Liu, Jianghui. “RNA structure analysis : algorithms and applications.” 2005. Doctoral Dissertation, New Jersey Institute of Technology. Accessed December 12, 2019. https://digitalcommons.njit.edu/dissertations/730.

MLA Handbook (7th Edition):

Liu, Jianghui. “RNA structure analysis : algorithms and applications.” 2005. Web. 12 Dec 2019.

Vancouver:

Liu J. RNA structure analysis : algorithms and applications. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2005. [cited 2019 Dec 12]. Available from: https://digitalcommons.njit.edu/dissertations/730.

Council of Science Editors:

Liu J. RNA structure analysis : algorithms and applications. [Doctoral Dissertation]. New Jersey Institute of Technology; 2005. Available from: https://digitalcommons.njit.edu/dissertations/730

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

Degree: PhD, Computer Science, 2013, Georgia Tech

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

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

…refer to the indicator constraint, big-M, and convex-hull transformations as implemented by… …rewrite. . . . . . . . . . . . . . . . . . 94 16 General form of the EM algorithm… …depicting the derived algorithm. . . . . . . . . . . . . . . 107 ix SUMMARY Machine learning… …languages, such as SQL, as well as languages for constraint programming. In this vein, there is… …question are either • specific algorithms, such as the C4.5 decision tree learning algorithm or… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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

21. Das, Aparna. Approximation Schemes for Euclidean Vehicle Routing Problems.

Degree: PhD, Computer Science, 2011, Brown University

 Vehicle routing is a class of optimization problems where the objective is to find low cost delivery routes from depots to customers using vehicles of… (more)

Subjects/Keywords: Geometric Approximation Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, A. (2011). Approximation Schemes for Euclidean Vehicle Routing Problems. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11205/

Chicago Manual of Style (16th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Doctoral Dissertation, Brown University. Accessed December 12, 2019. https://repository.library.brown.edu/studio/item/bdr:11205/.

MLA Handbook (7th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Web. 12 Dec 2019.

Vancouver:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Dec 12]. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/.

Council of Science Editors:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/

22. Halappanavar, Mahantesh. Algorithms for Vertex-Weighted Matching in Graphs.

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

  A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex.… (more)

Subjects/Keywords: Parallel half approximation; Vertex-weighted matching; Weighted matching; Matching theory; Graph theory; Computer Sciences; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halappanavar, M. (2009). Algorithms for Vertex-Weighted Matching in Graphs. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

Chicago Manual of Style (16th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Doctoral Dissertation, Old Dominion University. Accessed December 12, 2019. 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

MLA Handbook (7th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Web. 12 Dec 2019.

Vancouver:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Internet] [Doctoral dissertation]. Old Dominion University; 2009. [cited 2019 Dec 12]. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

Council of Science Editors:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Doctoral Dissertation]. Old Dominion University; 2009. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

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

Degree: PhD, Computer Science, 2010, Brown University

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

Subjects/Keywords: Stochastic Assembly

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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

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

Degree: PhD, Computer Science, 2009, Brown University

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

Subjects/Keywords: stochastic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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


University of Georgia

25. 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 12, 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. 12 Dec 2019.

Vancouver:

Xing G. Generating NFA for efficient pattern matching. [Internet] [Doctoral dissertation]. University of Georgia; 2001. [cited 2019 Dec 12]. 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

26. Malitsky, Yuri. Instance-Specific Algorithm Configuration.

Degree: PhD, Computer Science, 2012, Brown University

 When developing a new heuristic or complete algorithm for a constraint satisfaction or constrained optimization problem, we frequently face the problem of choice. There may… (more)

Subjects/Keywords: algorithm configuration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malitsky, Y. (2012). Instance-Specific Algorithm Configuration. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297609/

Chicago Manual of Style (16th Edition):

Malitsky, Yuri. “Instance-Specific Algorithm Configuration.” 2012. Doctoral Dissertation, Brown University. Accessed December 12, 2019. https://repository.library.brown.edu/studio/item/bdr:297609/.

MLA Handbook (7th Edition):

Malitsky, Yuri. “Instance-Specific Algorithm Configuration.” 2012. Web. 12 Dec 2019.

Vancouver:

Malitsky Y. Instance-Specific Algorithm Configuration. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Dec 12]. Available from: https://repository.library.brown.edu/studio/item/bdr:297609/.

Council of Science Editors:

Malitsky Y. Instance-Specific Algorithm Configuration. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297609/

27. Zhang, Sushu. System Level Power and Thermal Management on Embedded Processors.

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

 Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and heat… (more)

Subjects/Keywords: Computer science; Approximation algorithm; Dynamic power management; Dynamic voltage/frequency scaling; Low power design; Scheduling; Thermal management

programming algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 123 Computational complexity… …44 Approximation algorithm… …Page 77 Approximation algorithm… …Approximation algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 Proofs for FPTAS… …procedure invoked by the approximation algorithm)… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, S. (2012). System Level Power and Thermal Management on Embedded Processors. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/14683

Chicago Manual of Style (16th Edition):

Zhang, Sushu. “System Level Power and Thermal Management on Embedded Processors.” 2012. Doctoral Dissertation, Arizona State University. Accessed December 12, 2019. http://repository.asu.edu/items/14683.

MLA Handbook (7th Edition):

Zhang, Sushu. “System Level Power and Thermal Management on Embedded Processors.” 2012. Web. 12 Dec 2019.

Vancouver:

Zhang S. System Level Power and Thermal Management on Embedded Processors. [Internet] [Doctoral dissertation]. Arizona State University; 2012. [cited 2019 Dec 12]. Available from: http://repository.asu.edu/items/14683.

Council of Science Editors:

Zhang S. System Level Power and Thermal Management on Embedded Processors. [Doctoral Dissertation]. Arizona State University; 2012. Available from: http://repository.asu.edu/items/14683


University of Iowa

28. Xu, Yi. Accelerating convex optimization in machine learning by leveraging functional growth conditions.

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

  In recent years, unprecedented growths in scale and dimensionality of data raise big computational challenges for traditional optimization algorithms; thus it becomes very important… (more)

Subjects/Keywords: Convex Optimization; Local Error Bound; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, Y. (2019). Accelerating convex optimization in machine learning by leveraging functional growth conditions. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/7048

Chicago Manual of Style (16th Edition):

Xu, Yi. “Accelerating convex optimization in machine learning by leveraging functional growth conditions.” 2019. Doctoral Dissertation, University of Iowa. Accessed December 12, 2019. https://ir.uiowa.edu/etd/7048.

MLA Handbook (7th Edition):

Xu, Yi. “Accelerating convex optimization in machine learning by leveraging functional growth conditions.” 2019. Web. 12 Dec 2019.

Vancouver:

Xu Y. Accelerating convex optimization in machine learning by leveraging functional growth conditions. [Internet] [Doctoral dissertation]. University of Iowa; 2019. [cited 2019 Dec 12]. Available from: https://ir.uiowa.edu/etd/7048.

Council of Science Editors:

Xu Y. Accelerating convex optimization in machine learning by leveraging functional growth conditions. [Doctoral Dissertation]. University of Iowa; 2019. Available from: https://ir.uiowa.edu/etd/7048


University of Iowa

29. Bandyapadhyay, Sayan. Digging deeper into clustering and covering problems.

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

  Clustering problems often arise in the fields like data mining, machine learning and computational biology to group a collection of objects into similar groups… (more)

Subjects/Keywords: Approximation; Clustering; Covering; Inapproximability; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bandyapadhyay, S. (2019). Digging deeper into clustering and covering problems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/6700

Chicago Manual of Style (16th Edition):

Bandyapadhyay, Sayan. “Digging deeper into clustering and covering problems.” 2019. Doctoral Dissertation, University of Iowa. Accessed December 12, 2019. https://ir.uiowa.edu/etd/6700.

MLA Handbook (7th Edition):

Bandyapadhyay, Sayan. “Digging deeper into clustering and covering problems.” 2019. Web. 12 Dec 2019.

Vancouver:

Bandyapadhyay S. Digging deeper into clustering and covering problems. [Internet] [Doctoral dissertation]. University of Iowa; 2019. [cited 2019 Dec 12]. Available from: https://ir.uiowa.edu/etd/6700.

Council of Science Editors:

Bandyapadhyay S. Digging deeper into clustering and covering problems. [Doctoral Dissertation]. University of Iowa; 2019. Available from: https://ir.uiowa.edu/etd/6700


University of Southern California

30. Lee, Hyokyeong. Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model.

Degree: PhD, Computer Science, 2010, University of Southern California

 In petroleum community, the oil field optimization, i.e., minimizing the operational cost and maximizing the oil recovery, is a challenging problem. One of the popular… (more)

Subjects/Keywords: hybrid optimization; constrained nonlinear optimization; constrained linear least squares; dimensionality reduction; sequential quadratic programming; quasi-Newton method; line search; injector-producer relationship; capacitance-resistive model; structure learning of factor graphs; locality principle; belief discrepancies; large-scale constrained nonlinear optimization; factor graph and the sum-product algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, H. (2010). Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912

Chicago Manual of Style (16th Edition):

Lee, Hyokyeong. “Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model.” 2010. Doctoral Dissertation, University of Southern California. Accessed December 12, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912.

MLA Handbook (7th Edition):

Lee, Hyokyeong. “Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model.” 2010. Web. 12 Dec 2019.

Vancouver:

Lee H. Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2019 Dec 12]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912.

Council of Science Editors:

Lee H. Parameter estimation to infer injector-producer relationships in oil fields: from hybrid constrained nonlinear optimization to inference in probabilistic graphical model. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/367302/rec/4912

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

.