Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Set Cover)`

.
Showing records 1 – 28 of
28 total matches.

▼ Search Limiters

Penn State University

1.
Yu, Huiwen.
Combinatorial And Algebraic Algorithms In *Set* Covering And Partitioning Problems.

Degree: 2014, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/21928

► In this dissertation, we focus on using combinatorial and algebraic methods on two classes of NP-hard problems, the *set* covering problem and the *set* partitioning…
(more)

Subjects/Keywords: k-set cover; k-set packing; streaming set cover; space saving; diversifying

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yu, H. (2014). Combinatorial And Algebraic Algorithms In Set Covering And Partitioning Problems. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/21928

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yu, Huiwen. “Combinatorial And Algebraic Algorithms In Set Covering And Partitioning Problems.” 2014. Thesis, Penn State University. Accessed December 03, 2020. https://submit-etda.libraries.psu.edu/catalog/21928.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yu, Huiwen. “Combinatorial And Algebraic Algorithms In Set Covering And Partitioning Problems.” 2014. Web. 03 Dec 2020.

Vancouver:

Yu H. Combinatorial And Algebraic Algorithms In Set Covering And Partitioning Problems. [Internet] [Thesis]. Penn State University; 2014. [cited 2020 Dec 03]. Available from: https://submit-etda.libraries.psu.edu/catalog/21928.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yu H. Combinatorial And Algebraic Algorithms In Set Covering And Partitioning Problems. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/21928

Not specified: Masters Thesis or Doctoral Dissertation

Ohio University

2.
Schmidt, Robert J.M.
Using Weighted *Set* *Cover* to Identify Biologically
Significant Motifs.

Degree: MS, Computer Science (Engineering and Technology), 2015, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447797982

► One of the greatest challenges of mankind is understanding how living organisms operate, and a key step towards understanding this challenge is identifying how genes…
(more)

Subjects/Keywords: Bioinformatics; Computer Science; Discriminative Motif Discovery; Weighted Set Cover; Greedy Set Cover; Linear Programming; ENCODE

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schmidt, R. J. M. (2015). Using Weighted Set Cover to Identify Biologically Significant Motifs. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447797982

Chicago Manual of Style (16^{th} Edition):

Schmidt, Robert J M. “Using Weighted Set Cover to Identify Biologically Significant Motifs.” 2015. Masters Thesis, Ohio University. Accessed December 03, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447797982.

MLA Handbook (7^{th} Edition):

Schmidt, Robert J M. “Using Weighted Set Cover to Identify Biologically Significant Motifs.” 2015. Web. 03 Dec 2020.

Vancouver:

Schmidt RJM. Using Weighted Set Cover to Identify Biologically Significant Motifs. [Internet] [Masters thesis]. Ohio University; 2015. [cited 2020 Dec 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447797982.

Council of Science Editors:

Schmidt RJM. Using Weighted Set Cover to Identify Biologically Significant Motifs. [Masters Thesis]. Ohio University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447797982

George Mason University

3. Bryant, James Jr. Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia .

Degree: 2013, George Mason University

URL: http://hdl.handle.net/1920/8627

► Facility location problems constitute an area of study that has been extensively researched due to the opportunities presented for small businesses and corporations to increase…
(more)

Subjects/Keywords: bike share; location science; max cover; facility location; set cover; Richmond

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bryant, J. J. (2013). Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8627

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bryant, James Jr. “Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia .” 2013. Thesis, George Mason University. Accessed December 03, 2020. http://hdl.handle.net/1920/8627.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bryant, James Jr. “Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia .” 2013. Web. 03 Dec 2020.

Vancouver:

Bryant JJ. Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia . [Internet] [Thesis]. George Mason University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1920/8627.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bryant JJ. Finding the Optimal Locations for Bike Sharing Stations: A Case Study within the City of Richmond, Virginia . [Thesis]. George Mason University; 2013. Available from: http://hdl.handle.net/1920/8627

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

4. Grant, Elyot. Covering Problems via Structural Approaches.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/6317

► The minimum *set* *cover* problem is, without question, among the most ubiquitous and well-studied problems in computer science. Its theoretical hardness has been fully characterized –…
(more)

Subjects/Keywords: set cover; combinatorial optimization; computational geometry; quasi-uniform sampling; hitting set; apx-hard; dynamic programming; capacitated covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Grant, E. (2011). Covering Problems via Structural Approaches. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Web. 03 Dec 2020.

Vancouver:

Grant E. Covering Problems via Structural Approaches. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grant E. Covering Problems via Structural Approaches. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

5. Simon Peter Kanaan. Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>.

Degree: Computer Science and Engineering, 2012, University of Notre Dame

URL: https://curate.nd.edu/show/kd17cr58w85

► A goal of contemporary proteome research is the elucidation of protein-protein interactions in a cell. Based on currently available protein-protein interaction and domain data…
(more)

Subjects/Keywords: Set Cover Problem; Protein-Protein Interactions; Domain-Domain Interactions; MSSC; Domain Combinations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kanaan, S. P. (2012). Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/kd17cr58w85

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kanaan, Simon Peter. “Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>.” 2012. Thesis, University of Notre Dame. Accessed December 03, 2020. https://curate.nd.edu/show/kd17cr58w85.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kanaan, Simon Peter. “Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>.” 2012. Web. 03 Dec 2020.

Vancouver:

Kanaan SP. Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>. [Internet] [Thesis]. University of Notre Dame; 2012. [cited 2020 Dec 03]. Available from: https://curate.nd.edu/show/kd17cr58w85.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kanaan SP. Inferring Protein-Protein Interactions from Protein Domain Combinations</h1>. [Thesis]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/kd17cr58w85

Not specified: Masters Thesis or Doctoral Dissertation

University of Melbourne

6.
Lim, Ching Lih.
A suite of greedy methods for *set* *cover* computation.

Degree: 2015, University of Melbourne

URL: http://hdl.handle.net/11343/58207

► The *Set* *Cover* problem is simple to describe: if a collection of sets is given, each containing a subset of a universe of elements, the…
(more)

Subjects/Keywords: greedy strategy; set cover problem; efficiency; large input size; secondary storage; hapax legomena

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lim, C. L. (2015). A suite of greedy methods for set cover computation. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/58207

Chicago Manual of Style (16^{th} Edition):

Lim, Ching Lih. “A suite of greedy methods for set cover computation.” 2015. Masters Thesis, University of Melbourne. Accessed December 03, 2020. http://hdl.handle.net/11343/58207.

MLA Handbook (7^{th} Edition):

Lim, Ching Lih. “A suite of greedy methods for set cover computation.” 2015. Web. 03 Dec 2020.

Vancouver:

Lim CL. A suite of greedy methods for set cover computation. [Internet] [Masters thesis]. University of Melbourne; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11343/58207.

Council of Science Editors:

Lim CL. A suite of greedy methods for set cover computation. [Masters Thesis]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/58207

7. Haanpää, Harri. Constructing Certain Combinatorial Structures by Computational Methods.

Degree: 2004, Helsinki University of Technology

URL: http://lib.tkk.fi/Diss/2004/isbn9512269422/

►

Combinatorics is a branch of mathematics that generally deals with a finite or at most countably infinite *set* and collections of its subsets. These collections…
(more)

Subjects/Keywords: balanced incomplete block design; difference cover; difference packing; isomorph rejection; orderly algorithm; Ramsey number; Sidon set; sum cover; sum packing; whist tournament

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Haanpää, H. (2004). Constructing Certain Combinatorial Structures by Computational Methods. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2004/isbn9512269422/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Haanpää, Harri. “Constructing Certain Combinatorial Structures by Computational Methods.” 2004. Thesis, Helsinki University of Technology. Accessed December 03, 2020. http://lib.tkk.fi/Diss/2004/isbn9512269422/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Haanpää, Harri. “Constructing Certain Combinatorial Structures by Computational Methods.” 2004. Web. 03 Dec 2020.

Vancouver:

Haanpää H. Constructing Certain Combinatorial Structures by Computational Methods. [Internet] [Thesis]. Helsinki University of Technology; 2004. [cited 2020 Dec 03]. Available from: http://lib.tkk.fi/Diss/2004/isbn9512269422/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haanpää H. Constructing Certain Combinatorial Structures by Computational Methods. [Thesis]. Helsinki University of Technology; 2004. Available from: http://lib.tkk.fi/Diss/2004/isbn9512269422/

Not specified: Masters Thesis or Doctoral Dissertation

University of Iowa

8.
Gibson, Matthew Richard.
Clusters and covers: geometric *set* *cover* algorithms.

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

URL: https://ir.uiowa.edu/etd/502

► The *set* *cover* problem is a well studied problem in computer science. The problem cannot be approximated to better than an log n-factor in…
(more)

Subjects/Keywords: approximation algorithms; computational geometry; decomposing coverings; sensor cover; set cover; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gibson, M. R. (2010). Clusters and covers: geometric set cover algorithms. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/502

Chicago Manual of Style (16^{th} Edition):

Gibson, Matthew Richard. “Clusters and covers: geometric set cover algorithms.” 2010. Doctoral Dissertation, University of Iowa. Accessed December 03, 2020. https://ir.uiowa.edu/etd/502.

MLA Handbook (7^{th} Edition):

Gibson, Matthew Richard. “Clusters and covers: geometric set cover algorithms.” 2010. Web. 03 Dec 2020.

Vancouver:

Gibson MR. Clusters and covers: geometric set cover algorithms. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2020 Dec 03]. Available from: https://ir.uiowa.edu/etd/502.

Council of Science Editors:

Gibson MR. Clusters and covers: geometric set cover algorithms. [Doctoral Dissertation]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/502

University of Iowa

9. Krohn, Erik Allyn. Surveilling roads and protecting art.

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

URL: https://ir.uiowa.edu/etd/390

► Placing security cameras in buildings, finding good locations for cameras to enforce speed limits or placing guards to defend a border are some of…
(more)

Subjects/Keywords: algorithms; complexity; geometry; set cover; terrain; theory; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krohn, E. A. (2009). Surveilling roads and protecting art. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/390

Chicago Manual of Style (16^{th} Edition):

Krohn, Erik Allyn. “Surveilling roads and protecting art.” 2009. Doctoral Dissertation, University of Iowa. Accessed December 03, 2020. https://ir.uiowa.edu/etd/390.

MLA Handbook (7^{th} Edition):

Krohn, Erik Allyn. “Surveilling roads and protecting art.” 2009. Web. 03 Dec 2020.

Vancouver:

Krohn EA. Surveilling roads and protecting art. [Internet] [Doctoral dissertation]. University of Iowa; 2009. [cited 2020 Dec 03]. Available from: https://ir.uiowa.edu/etd/390.

Council of Science Editors:

Krohn EA. Surveilling roads and protecting art. [Doctoral Dissertation]. University of Iowa; 2009. Available from: https://ir.uiowa.edu/etd/390

Delft University of Technology

10. Vonk, Maarten (author). Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:d43a7486-9a1d-42c3-9026-cabdb3e49d2a

►

With cockpit crew costs being the second largest costs of an airline, making optimal use of the available crew is very important. The productivity of… (more)

Subjects/Keywords: Crew Scheduling; Crew Pairing; Crew Rostering; Column Generating; Network Flow; Min Cost Flow; Matchings; Set Cover; ILP

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vonk, M. (. (2018). Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d43a7486-9a1d-42c3-9026-cabdb3e49d2a

Chicago Manual of Style (16^{th} Edition):

Vonk, Maarten (author). “Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules.” 2018. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:d43a7486-9a1d-42c3-9026-cabdb3e49d2a.

MLA Handbook (7^{th} Edition):

Vonk, Maarten (author). “Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules.” 2018. Web. 03 Dec 2020.

Vancouver:

Vonk M(. Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:d43a7486-9a1d-42c3-9026-cabdb3e49d2a.

Council of Science Editors:

Vonk M(. Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:d43a7486-9a1d-42c3-9026-cabdb3e49d2a

11.
Dutta, Himanshu Shekhar.
Survey of Approximation Algorithms for *Set* *Cover* Problem.

Degree: 2009, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc12118/

► In this thesis, I survey 11 approximation algorithms for unweighted *set* *cover* problem. I have also implemented the three algorithms and created a software library…
(more)

Subjects/Keywords: Set cover; approximation algorithm; greedy algorithm; Approximation algorithms.; Set theory.

…LIST OF FIGURES
1.1 *Set* *Cover* in Geometry. 2
1.2 Hitting *Set* in… …Example 2.4 …..............30
4.1 Bipartite graph B for *Set* *Cover* Problem in… …Network. ...68
vii
LIST OF TABLES
5.1 Performance Ratio for Different *Set* *Cover*… …Algorithms …72
viii
CHAPTER 1
INTRODUCTION
1.1 Motivation
*Set* *cover* is an optimization… …major application of *set* *cover* problem is in wireless network [1,2].
Take an example…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dutta, H. S. (2009). Survey of Approximation Algorithms for Set Cover Problem. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc12118/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Dutta, Himanshu Shekhar. “Survey of Approximation Algorithms for Set Cover Problem.” 2009. Thesis, University of North Texas. Accessed December 03, 2020. https://digital.library.unt.edu/ark:/67531/metadc12118/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dutta, Himanshu Shekhar. “Survey of Approximation Algorithms for Set Cover Problem.” 2009. Web. 03 Dec 2020.

Vancouver:

Dutta HS. Survey of Approximation Algorithms for Set Cover Problem. [Internet] [Thesis]. University of North Texas; 2009. [cited 2020 Dec 03]. Available from: https://digital.library.unt.edu/ark:/67531/metadc12118/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dutta HS. Survey of Approximation Algorithms for Set Cover Problem. [Thesis]. University of North Texas; 2009. Available from: https://digital.library.unt.edu/ark:/67531/metadc12118/

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

12. Chengbang Huang. Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>.

Degree: Computer Science and Engineering, 2005, University of Notre Dame

URL: https://curate.nd.edu/show/ht24wh26f73

► Biocomplexity is the study of the complex relationships among biological entities that are responsible for life. This dissertation addresses two important computational in biocomplexity:…
(more)

Subjects/Keywords: Extended Potts Model; Protein Interaction Prediction; Limb Growth Simulation; Set Cover; Reaction Diffusion; Morphogenesis; Maximum Specificity Set Cover

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, C. (2005). Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/ht24wh26f73

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Huang, Chengbang. “Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>.” 2005. Thesis, University of Notre Dame. Accessed December 03, 2020. https://curate.nd.edu/show/ht24wh26f73.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Chengbang. “Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>.” 2005. Web. 03 Dec 2020.

Vancouver:

Huang C. Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>. [Internet] [Thesis]. University of Notre Dame; 2005. [cited 2020 Dec 03]. Available from: https://curate.nd.edu/show/ht24wh26f73.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang C. Multiscale Computational Methods for Morphogenesis and Algorithms for Protein-Protein Interaction Inference</h1>. [Thesis]. University of Notre Dame; 2005. Available from: https://curate.nd.edu/show/ht24wh26f73

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

13. Agrawal, Akanksha. Delaunay Graphs for Various Geometric Objects.

Degree: MSc Engg, Faculty of Engineering, 2017, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/2906

► Given a *set* of n points P ⊂ R2, the Delaunay graph of P for a family of geometric objects C is a graph defined…
(more)

Subjects/Keywords: Delaunay Triangulation; Delaunay Graphs; Computational Geometry; Vertex Cover; Triangulations; Axis-Paralalel Slabs; Maximal-Planar Graphs; Fixed Parameter Tractable Algorithms; Hitting Set; NP-completeness; Chordless-NST; Geometric Objects; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Agrawal, A. (2017). Delaunay Graphs for Various Geometric Objects. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2906

Chicago Manual of Style (16^{th} Edition):

Agrawal, Akanksha. “Delaunay Graphs for Various Geometric Objects.” 2017. Masters Thesis, Indian Institute of Science. Accessed December 03, 2020. http://etd.iisc.ac.in/handle/2005/2906.

MLA Handbook (7^{th} Edition):

Agrawal, Akanksha. “Delaunay Graphs for Various Geometric Objects.” 2017. Web. 03 Dec 2020.

Vancouver:

Agrawal A. Delaunay Graphs for Various Geometric Objects. [Internet] [Masters thesis]. Indian Institute of Science; 2017. [cited 2020 Dec 03]. Available from: http://etd.iisc.ac.in/handle/2005/2906.

Council of Science Editors:

Agrawal A. Delaunay Graphs for Various Geometric Objects. [Masters Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2906

University of Vienna

14. Romauch, Martin. Facility location and related problems.

Degree: 2007, University of Vienna

URL: http://othes.univie.ac.at/361/

►

PRINTAUSGABE IN HAUPTBIBLIOTHEK NICHT EINGELANGT! – Bei Standortoptimierungsproblemen geht es um eine strategisch günstige Auswahl von Orten unter den Gesichtspunkten des Nutzens und der Aufwände,… (more)

Subjects/Keywords: 85.00 Betriebswirtschaft: Allgemeines; Standortoptimierung / doppeltes Mengenüberdeckungsproblem; facility location / double Set Cover Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Romauch, M. (2007). Facility location and related problems. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/361/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Romauch, Martin. “Facility location and related problems.” 2007. Thesis, University of Vienna. Accessed December 03, 2020. http://othes.univie.ac.at/361/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Romauch, Martin. “Facility location and related problems.” 2007. Web. 03 Dec 2020.

Vancouver:

Romauch M. Facility location and related problems. [Internet] [Thesis]. University of Vienna; 2007. [cited 2020 Dec 03]. Available from: http://othes.univie.ac.at/361/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Romauch M. Facility location and related problems. [Thesis]. University of Vienna; 2007. Available from: http://othes.univie.ac.at/361/

Not specified: Masters Thesis or Doctoral Dissertation

15.
Liu, Yating.
Motif Selection via a Tabu Search Solution to the *Set* *Cover*
Problem.

Degree: MS, Computer Science (Engineering and Technology), 2017, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744

► Transcription factors (TFs) regulate gene expression through interaction with specific DNA regions, called transcription factor binding sites (TFBSs). Identifying TFBSs can help in understanding the…
(more)

Subjects/Keywords: Bioinformatics; Computer Science; motif selection; tabu search; set cover problem

…discovery tools failed to find one motif, or a small *set*
of motifs, that *cover* all the ChIP-seq… …in si . A *set* of motifs is said to *cover* a sequence si ∈ S iff any of the motifs occurs… …variations of the
*set* *cover* optimization problems. Subsequently, a heuristic local search algorithm… …*set* *cover*-based motif selection problem
The minimum *set* *cover* problem (SCP) is one… …sn } and M = {m1 , m2 , m3 , ..., mk }, minimum *set* *cover* problem
can be…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2017). Motif Selection via a Tabu Search Solution to the Set Cover Problem. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744

Chicago Manual of Style (16^{th} Edition):

Liu, Yating. “Motif Selection via a Tabu Search Solution to the Set Cover Problem.” 2017. Masters Thesis, Ohio University. Accessed December 03, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744.

MLA Handbook (7^{th} Edition):

Liu, Yating. “Motif Selection via a Tabu Search Solution to the Set Cover Problem.” 2017. Web. 03 Dec 2020.

Vancouver:

Liu Y. Motif Selection via a Tabu Search Solution to the Set Cover Problem. [Internet] [Masters thesis]. Ohio University; 2017. [cited 2020 Dec 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744.

Council of Science Editors:

Liu Y. Motif Selection via a Tabu Search Solution to the Set Cover Problem. [Masters Thesis]. Ohio University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1501626790431744

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

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

URL: https://ir.uiowa.edu/etd/5418

► 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

…instance
of the *Set* *Cover* problem consists of a ground *set* X and a *set* of subsets F of X .
Each… …1 for all
S ∈ F, we have the unweighted *Set* *Cover* Problem. A feasible solution to a *set*… …is called a *set* *cover*, whose weight is the sum of the weights of the sets in the *cover*.
The… …objective is to find a minimum weight *set* *cover* for any instance (X , F, w). If the… …brief description of the history and origins of the *Set* *Cover*
problem, leading to its…

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

17. Mouawad, Amer. On Reconfiguration Problems: Structure and Tractability.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9183

► Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the…
(more)

Subjects/Keywords: reconfiguration; solution space; complexity; fixed-parameter tractability; independent set; vertex cover; dominating set

…*set* S ⊆ V (G), a vertex *cover* of G, such that |S| ≤ k and
every edge in E(G… …reconfiguration
variants of problems such as Vertex *Cover* (or Independent *Set*) might provide… …NPcomplete problems of Power Supply, Clique, Independent *Set*, Vertex *Cover*,
*Set* *Cover*, Dominating… …Vertex *Cover*
NPC
PSPACEC
Independent *Set*
NPC
PSPACEC
Clique
NPC
PSPACEC
Dominating *Set*
NPC… …Fixed-parameter tractable algorithms . . . . . . . . . . . . . . . . .
64
4 Vertex *cover*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mouawad, A. (2015). On Reconfiguration Problems: Structure and Tractability. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9183

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mouawad, Amer. “On Reconfiguration Problems: Structure and Tractability.” 2015. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/9183.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mouawad, Amer. “On Reconfiguration Problems: Structure and Tractability.” 2015. Web. 03 Dec 2020.

Vancouver:

Mouawad A. On Reconfiguration Problems: Structure and Tractability. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/9183.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mouawad A. On Reconfiguration Problems: Structure and Tractability. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9183

Not specified: Masters Thesis or Doctoral Dissertation

18. Hu, Nan. Approximation Algorithms for Geometric Covering Problems for Disks and Squares.

Degree: 2013, University of Waterloo

URL: http://hdl.handle.net/10012/7703

► Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk *Cover*, Depth-(≤ K) Packing and Red-Blue Unit-Square *Cover*. In…
(more)

Subjects/Keywords: computational geometry; approximation algorithm; PTAS; Red-Blue Set Cover; Depth-(<; K) Packing; Disjoint Unit-Disk Cover

…*cover* another *set*
of objects (often points). These problems are motivated by… …the objects. For example, in the Unit-Disk *Cover*
problem, given a point *set*, one wants to… …*Cover* problem will be called Geometric *Set* *Cover*
for Unit Disks. Given a point *set* and a *set*… …squares
are axis-aligned.
1
1.1
The *Set* *Cover* Problem and Variations
*Set* *Cover*. One of the… …most important and best-known covering problem is the *Set*
*Cover* problem. Given a *set* of…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hu, N. (2013). Approximation Algorithms for Geometric Covering Problems for Disks and Squares. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7703

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hu, Nan. “Approximation Algorithms for Geometric Covering Problems for Disks and Squares.” 2013. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/7703.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hu, Nan. “Approximation Algorithms for Geometric Covering Problems for Disks and Squares.” 2013. Web. 03 Dec 2020.

Vancouver:

Hu N. Approximation Algorithms for Geometric Covering Problems for Disks and Squares. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/7703.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hu N. Approximation Algorithms for Geometric Covering Problems for Disks and Squares. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7703

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

19. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: PhD, Industrial Engineering, 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155568

► In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,…
(more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

Chicago Manual of Style (16^{th} Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Doctoral Dissertation, Texas A&M University. Accessed December 03, 2020. http://hdl.handle.net/1969.1/155568.

MLA Handbook (7^{th} Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 03 Dec 2020.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1969.1/155568.

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

20. Αθανασόπουλος, Σταύρος. Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα.

Degree: 2009, University of Patras

URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/2102

► Στην παρούσα διδακτορική διατριβή, ασχολούµαστε µε ζητήµατα που ανακύπτουν σε ασύρµατα δίκτυα επικοινωνίας, δηλ. δίκτυα που βασίζονται σε τηλεπικοινωνιακή υποδοµή όπως τα κυψελικά δίκτυα κινητής…
(more)

Subjects/Keywords: Ασύρματα δίκτυα; Αλγόριθμοι; Ενέργεια; Κάλυψη με σύνολα; Αδόμητα δίκτυα; Πολλαπλά μέσα ασύρματης διασύνδεσης; Γεννητικά δένδρα; Δάσος αστέρων; Αλγόριθμοι μετάδοσης; Δένδρο μετάδοσης; Ad hoc networks; Multiple interfaces; Wireless networks; Algorithms; Energy consumption; Set cover; Spanning trees; Star forest; Minimum energy multicasting; Multicast tree

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Αθανασόπουλος, . (2009). Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα. (Doctoral Dissertation). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/2102

Chicago Manual of Style (16^{th} Edition):

Αθανασόπουλος, Σταύρος. “Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα.” 2009. Doctoral Dissertation, University of Patras. Accessed December 03, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/2102.

MLA Handbook (7^{th} Edition):

Αθανασόπουλος, Σταύρος. “Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα.” 2009. Web. 03 Dec 2020.

Vancouver:

Αθανασόπουλος . Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα. [Internet] [Doctoral dissertation]. University of Patras; 2009. [cited 2020 Dec 03]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2102.

Council of Science Editors:

Αθανασόπουλος . Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα. [Doctoral Dissertation]. University of Patras; 2009. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2102

21. Tratnik, Niko. Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock.

Degree: 2014, Univerza v Mariboru

URL: https://dk.um.si/IzpisGradiva.php?id=45135 ; https://dk.um.si/Dokument.php?id=65193&dn= ; https://plus.si.cobiss.net/opac7/bib/20803848?lang=sl

►

Magistrska naloga obravnava celotne benzenoidne sisteme in njihove resonančne grafe. Izraz ''celotni benzenoidni sistem'' uporabljamo kot skupno ime za benzenoidne sisteme in odprte ogljikove nanocevke.… (more)

Subjects/Keywords: celotni benzenoidni sistem; popolno prirejanje; resonančni graf; resonantna množica; Clarovo pokritje; Zhang-Zhang-ov polinom; polinom kock.; whole benzenoid system; perfect matching; resonance graph; resonant set; Clar cover; Zhang-Zhang polynomial; cube polynomial; info:eu-repo/classification/udc/519.17:54(043.2)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tratnik, N. (2014). Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=45135 ; https://dk.um.si/Dokument.php?id=65193&dn= ; https://plus.si.cobiss.net/opac7/bib/20803848?lang=sl

Chicago Manual of Style (16^{th} Edition):

Tratnik, Niko. “Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock.” 2014. Masters Thesis, Univerza v Mariboru. Accessed December 03, 2020. https://dk.um.si/IzpisGradiva.php?id=45135 ; https://dk.um.si/Dokument.php?id=65193&dn= ; https://plus.si.cobiss.net/opac7/bib/20803848?lang=sl.

MLA Handbook (7^{th} Edition):

Tratnik, Niko. “Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock.” 2014. Web. 03 Dec 2020.

Vancouver:

Tratnik N. Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock. [Internet] [Masters thesis]. Univerza v Mariboru; 2014. [cited 2020 Dec 03]. Available from: https://dk.um.si/IzpisGradiva.php?id=45135 ; https://dk.um.si/Dokument.php?id=65193&dn= ; https://plus.si.cobiss.net/opac7/bib/20803848?lang=sl.

Council of Science Editors:

Tratnik N. Celotni benzenoidni sistemi ter povezava med Zhang-Zhang-ovim polinomom in polinomom kock. [Masters Thesis]. Univerza v Mariboru; 2014. Available from: https://dk.um.si/IzpisGradiva.php?id=45135 ; https://dk.um.si/Dokument.php?id=65193&dn= ; https://plus.si.cobiss.net/opac7/bib/20803848?lang=sl

22.
Hou, Guangyu.
Finding the minimum illuminating direction *set* for a polyhedron.

Degree: 2019, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17466

► The minimum illuminating direction *set* *cover* problem for a polyhedron seeks the minimum cardinality *set* of 3-D directions that illuminate the entire polyhedron surface. This…
(more)

Subjects/Keywords: CNC machining; Minimum setups; Set cover problem; Spherical polygons; Tool Accessibility; Visibility; Computer Sciences

…illuminating direction *set* *cover* problem (Figure 1-4).
Visibility polygons
on unit sphere… …x7D;
={
} …
Figure 1-4 Formulating a *set* *cover* problem from the visibility… …inverse map is obtained, we can formulate a minimum *set* *cover* problem and use
greedy algorithm… …possible polynomial time approximation algorithm for *set* *cover* up to lower order terms
[29… …different polygon is chosen.
Department of Computer Science
19
4. Minimum *Set* *Cover* Solution…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hou, G. (2019). Finding the minimum illuminating direction set for a polyhedron. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17466

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hou, Guangyu. “Finding the minimum illuminating direction set for a polyhedron.” 2019. Thesis, Iowa State University. Accessed December 03, 2020. https://lib.dr.iastate.edu/etd/17466.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hou, Guangyu. “Finding the minimum illuminating direction set for a polyhedron.” 2019. Web. 03 Dec 2020.

Vancouver:

Hou G. Finding the minimum illuminating direction set for a polyhedron. [Internet] [Thesis]. Iowa State University; 2019. [cited 2020 Dec 03]. Available from: https://lib.dr.iastate.edu/etd/17466.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hou G. Finding the minimum illuminating direction set for a polyhedron. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/17466

Not specified: Masters Thesis or Doctoral Dissertation

23. Naik, Ashwini. Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage.

Degree: MS, Computer Science (Engineering and Technology), 2014, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1408699463

► Transcription factors bind to specific sequence elements present in the promoter regions of co-expressed genes and regulate their expression. Genes expressed in an identical manner…
(more)

Subjects/Keywords: Bioinformatics; Computer Science; Sequence Coverage; Motif Discovery; Set Cover; Mining; Greedy Method

…said to *cover*
those sequences.
The hypothesis is that a *set* of motifs that give 100… …definition of *Set* *Cover* and hence the same
Greedy solution was decided to be used for it also, with… …*cover* hitting *set*
problem” (p. ii14) was that if two or more TFs co-covered a *set* of… …sets in C is equivalent to U. C will be the required *set* *cover*.
31
The basic combinatorial… …of a *set* of DNA promoter regions can be modeled
by the Minimum *Set* *Cover* [15]…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naik, A. (2014). Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1408699463

Chicago Manual of Style (16^{th} Edition):

Naik, Ashwini. “Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage.” 2014. Masters Thesis, Ohio University. Accessed December 03, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1408699463.

MLA Handbook (7^{th} Edition):

Naik, Ashwini. “Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage.” 2014. Web. 03 Dec 2020.

Vancouver:

Naik A. Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage. [Internet] [Masters thesis]. Ohio University; 2014. [cited 2020 Dec 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1408699463.

Council of Science Editors:

Naik A. Mining Gene Regulatory Motifs Using the Concept of Sequence Coverage. [Masters Thesis]. Ohio University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1408699463

24. MEDURI VENKATA VAMSIKRISHNA. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.

Degree: 2011, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/20999

Subjects/Keywords: Databases; Complex Query optimization; Iterative Dynamic Programming; Sub query plan reuse; Cover set generation; Sub graph isomorphism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

VAMSIKRISHNA, M. V. (2011). Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/20999

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Thesis, National University of Singapore. Accessed December 03, 2020. http://scholarbank.nus.edu.sg/handle/10635/20999.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

VAMSIKRISHNA, MEDURI VENKATA. “Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization.” 2011. Web. 03 Dec 2020.

Vancouver:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2020 Dec 03]. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

VAMSIKRISHNA MV. Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/20999

Not specified: Masters Thesis or Doctoral Dissertation

Université Paris-Sud – Paris XI

25. Le Bodic, Pierre. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2012PA112190

►

Cette thèse est composée de deux parties, chacune portant sur un sous-domaine de l'optimisation combinatoire a priori distant de l'autre. Le premier thème de recherche… (more)

Subjects/Keywords: Programmation biniveau; Programmation stochastique; Problèmes de coupe; Problèmes de couverture; Multicoupe partielle; Coupe multiterminale partielle; Ensemble dominant partiel; Complexité; Approximation; Programmation dynamique; Graphes de largeur d'arbre bornée; Bilevel programming; Stochastic programming; Cut problems; Cover problems; Partial multicut; Partial multiterminal cut; Partial dominating set; Complexity; Approximation; Dynamic programming; Bounded treewidth graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Le Bodic, P. (2012). Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112190

Chicago Manual of Style (16^{th} Edition):

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed December 03, 2020. http://www.theses.fr/2012PA112190.

MLA Handbook (7^{th} Edition):

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Web. 03 Dec 2020.

Vancouver:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2020 Dec 03]. Available from: http://www.theses.fr/2012PA112190.

Council of Science Editors:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112190

Brno University of Technology

26. Knoflíček, Jakub. Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/53450

► This paper deals with various approaches to solving optimization tasks. In prolog some examples from real life that show the application of optimization methods are…
(more)

Subjects/Keywords: Optimalizační úlohy; optimalizační metody; simulované žíhání; optimalizace mravenčí kolonií; optimalizace hejnem částic; genetické algoritmy; posilované učení; problém více batohů; problém pokrytí množiny; Ackleyho funkce; Rastriginova funkce.; Optimization tasks; optimizations methods; simulated annealing; ant colony optimization; particle swarm optimization; genetic algorithms; reinforcement learning; multiple knapsack problem; set cover problem; Ackley's function; Rastrigin's function.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Knoflíček, J. (2018). Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53450

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Knoflíček, Jakub. “Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks.” 2018. Thesis, Brno University of Technology. Accessed December 03, 2020. http://hdl.handle.net/11012/53450.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Knoflíček, Jakub. “Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks.” 2018. Web. 03 Dec 2020.

Vancouver:

Knoflíček J. Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11012/53450.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Knoflíček J. Analýza různých přístupů k řešení optimalizačních úloh: Analysis of Various Approaches to Solving Optimization Tasks. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53450

Not specified: Masters Thesis or Doctoral Dissertation

27. Αθανασόπουλος, Σταύρος. Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα.

Degree: 2009, University of Patras; Πανεπιστήμιο Πατρών

URL: http://hdl.handle.net/10442/hedi/27938

►

In this dissertation, we study issues arising in wireless communication networks, i.e., networks based on telecommunication infrastructure like cellular wireless networks, networks of autonomous wireless… (more)

Subjects/Keywords: Ασύρματα δίκτυα; Αλγόριθμοι; Ενέργεια; Κάλυψη με σύνολα; Αδόμητα δίκτυα; Πολλαπλά μέσα ασύρματης διασύνδεσης; Γεννητικά δένδρα; Δάσος αστέρων; Αλγόριθμοι μετάδοσης; Δένδρο μετάδοσης; Αποδοτικοί αλγόριθμοι για κατανομή ενέργειας σε ασύρματα δίκτυα; Ad hoc networks; Multiple interfaces; Wireless networks; Algorithms; Energy consumption; Set cover; Spanning trees; Star forest; Minimum energy multicasting; Multicast tree

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Αθανασόπουλος, . . (2009). Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα. (Thesis). University of Patras; Πανεπιστήμιο Πατρών. Retrieved from http://hdl.handle.net/10442/hedi/27938

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Αθανασόπουλος, Σταύρος. “Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα.” 2009. Thesis, University of Patras; Πανεπιστήμιο Πατρών. Accessed December 03, 2020. http://hdl.handle.net/10442/hedi/27938.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Αθανασόπουλος, Σταύρος. “Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα.” 2009. Web. 03 Dec 2020.

Vancouver:

Αθανασόπουλος . Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2009. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10442/hedi/27938.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Αθανασόπουλος . Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα. [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2009. Available from: http://hdl.handle.net/10442/hedi/27938

Not specified: Masters Thesis or Doctoral Dissertation

28. Li, Yichao. Algorithmic Methods for Multi-Omics Biomarker Discovery.

Degree: PhD, Electrical Engineering & Computer Science (Engineering and Technology), 2018, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1541609328071533

► The central dogma of molecular biology states that DNA is transcribed into RNA, which is then translated into proteins. The flow of genetic information in…
(more)

Subjects/Keywords: Bioinformatics; Computer Science; Motif; Diabetes; Transcription Factor; HiC; Set Cover; Machine Learning; Ensemble Learning; HbA1C; Glycated Peptide; Motif Discovery; Motif Pair; 3D Genome Organization; DREAM challenge; Python; Data Analytics; Hist1; Clustering Analysis; Cross Validation

…model. . . . . . . . .
Shared motifs between the *set* *cover* and enrichment methods… …Putative cofactors discovered by the *set* *cover* based methods. . . . . . . . . .
Methods for… …challenge [13].
• A systematic evaluation of *set*-*cover* based motif selection algorithms… …splits the data into K1 folds. For each outer fold, use one fold as the
testing *set*, the rest… …nine folds as the training *set*. An inner CV loop splits the
training *set* into K2 folds. For…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Y. (2018). Algorithmic Methods for Multi-Omics Biomarker Discovery. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1541609328071533

Chicago Manual of Style (16^{th} Edition):

Li, Yichao. “Algorithmic Methods for Multi-Omics Biomarker Discovery.” 2018. Doctoral Dissertation, Ohio University. Accessed December 03, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1541609328071533.

MLA Handbook (7^{th} Edition):

Li, Yichao. “Algorithmic Methods for Multi-Omics Biomarker Discovery.” 2018. Web. 03 Dec 2020.

Vancouver:

Li Y. Algorithmic Methods for Multi-Omics Biomarker Discovery. [Internet] [Doctoral dissertation]. Ohio University; 2018. [cited 2020 Dec 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1541609328071533.

Council of Science Editors:

Li Y. Algorithmic Methods for Multi-Omics Biomarker Discovery. [Doctoral Dissertation]. Ohio University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1541609328071533