Advanced search options

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

You searched for `subject:(covering)`

.
Showing records 1 – 30 of
277 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] ▶

Search Limiters

Dates

- 2016 – 2020 (88)
- 2011 – 2015 (105)
- 2006 – 2010 (58)
- 2001 – 2005 (23)

Universities

- Brno University of Technology (29)
- University of São Paulo (21)
- Georgia Tech (11)

Department

- Computer Science (17)
- Mathematics (12)

Degrees

- PhD (56)
- MS (25)
- Docteur es (12)
- Mestrado (12)

Languages

- English (125)
- Portuguese (45)
- Czech (29)

▼ Search Limiters

1. Alkhalifa, Loay. Locating a Minisum Annulus.

Degree: MSc (MS/Maîtrise ès sciences), Mathematics/Mathématiques, 2014, Royal Military College of Canada

URL: http://hdl.handle.net/11264/201

►

The problem is to find the best location of a minisum annulus with given width using the partial coverage distance model. The concept of partial… (more)

Subjects/Keywords: minisum; minimax; covering; partial covering; annulus; strip

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alkhalifa, L. (2014). Locating a Minisum Annulus. (Masters Thesis). Royal Military College of Canada. Retrieved from http://hdl.handle.net/11264/201

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

Alkhalifa, Loay. “Locating a Minisum Annulus.” 2014. Masters Thesis, Royal Military College of Canada. Accessed September 19, 2020. http://hdl.handle.net/11264/201.

MLA Handbook (7^{th} Edition):

Alkhalifa, Loay. “Locating a Minisum Annulus.” 2014. Web. 19 Sep 2020.

Vancouver:

Alkhalifa L. Locating a Minisum Annulus. [Internet] [Masters thesis]. Royal Military College of Canada; 2014. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/11264/201.

Council of Science Editors:

Alkhalifa L. Locating a Minisum Annulus. [Masters Thesis]. Royal Military College of Canada; 2014. Available from: http://hdl.handle.net/11264/201

Oregon State University

2.
Golbabaei, Sanaz.
Branched *Covering* Space Construction and Visualization.

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

URL: http://hdl.handle.net/1957/59174

► Branched *covering* spaces are a mathematical concept which originates from complex analysis and topology and has found applications in tensor ﬁeld topology and geometry re-meshing.…
(more)

Subjects/Keywords: branched covering space; Covering spaces (Topology)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Golbabaei, S. (2016). Branched Covering Space Construction and Visualization. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/59174

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

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Masters Thesis, Oregon State University. Accessed September 19, 2020. http://hdl.handle.net/1957/59174.

MLA Handbook (7^{th} Edition):

Golbabaei, Sanaz. “Branched Covering Space Construction and Visualization.” 2016. Web. 19 Sep 2020.

Vancouver:

Golbabaei S. Branched Covering Space Construction and Visualization. [Internet] [Masters thesis]. Oregon State University; 2016. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1957/59174.

Council of Science Editors:

Golbabaei S. Branched Covering Space Construction and Visualization. [Masters Thesis]. Oregon State University; 2016. Available from: http://hdl.handle.net/1957/59174

University of Iowa

3.
Bandyapadhyay, Sayan.
Digging deeper into clustering and *covering* problems.

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

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

► 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 Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Bandyapadhyay, Sayan. “Digging deeper into clustering and covering problems.” 2019. Web. 19 Sep 2020.

Vancouver:

Bandyapadhyay S. Digging deeper into clustering and covering problems. [Internet] [Doctoral dissertation]. University of Iowa; 2019. [cited 2020 Sep 19]. 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

Vilnius University

4. Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.

Degree: Master, 2010, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

►

Nežinomo ploto dengimas yra aktuali ir paplitusi problema. NPD sprendimas realiuose robotuose susiduria su daviklių ir mechanizmų netikslumu. Atliktame darbe yra pateiktas „Bouncing“ NPD algoritmo… (more)

Subjects/Keywords: Area Coverage; Covering salesman; Robotic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zachaževski, Stanislav. (2010). Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

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

Author name may be incomplete

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

Zachaževski, Stanislav. “Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.” 2010. Masters Thesis, Vilnius University. Accessed September 19, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Zachaževski, Stanislav. “Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus.” 2010. Web. 19 Sep 2020.

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

Author name may be incomplete

Vancouver:

Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. [Internet] [Masters thesis]. Vilnius University; 2010. [cited 2020 Sep 19]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;.

Author name may be incomplete

Council of Science Editors:

Zachaževski, Stanislav. Nežinomų teritorijų tyrinėjimas naudojant savaeigius robotizuotus mechanizmus. [Masters Thesis]. Vilnius University; 2010. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20101125_190737-99166 ;

Author name may be incomplete

University of Windsor

5. Singh, Harjeet. Performance Evaluation of Weighted Greedy Algorithm in Resource Management.

Degree: MS, Computer Science, 2018, University of Windsor

URL: https://scholar.uwindsor.ca/etd/7397

► Set *covering* is a well-studied classical problem with many applications across different fields. More recent work on this problem has taken into account the parallel…
(more)

Subjects/Keywords: big data; set covering algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Singh, H. (2018). Performance Evaluation of Weighted Greedy Algorithm in Resource Management. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7397

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

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Masters Thesis, University of Windsor. Accessed September 19, 2020. https://scholar.uwindsor.ca/etd/7397.

MLA Handbook (7^{th} Edition):

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Web. 19 Sep 2020.

Vancouver:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Internet] [Masters thesis]. University of Windsor; 2018. [cited 2020 Sep 19]. Available from: https://scholar.uwindsor.ca/etd/7397.

Council of Science Editors:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Masters Thesis]. University of Windsor; 2018. Available from: https://scholar.uwindsor.ca/etd/7397

Virginia Tech

6.
Rogers, Donald Wayne, III.
On *Covering*: Queerness.

Degree: MA, Philosophy, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/99909

► The acts of passing and *covering* are socially constructed. To research them further, I spent a significant amount of time understanding others' experiences of passing…
(more)

Subjects/Keywords: passing; covering; standpoint epistemology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rogers, Donald Wayne, I. (2020). On Covering: Queerness. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/99909

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

Rogers, Donald Wayne, III. “On Covering: Queerness.” 2020. Masters Thesis, Virginia Tech. Accessed September 19, 2020. http://hdl.handle.net/10919/99909.

MLA Handbook (7^{th} Edition):

Rogers, Donald Wayne, III. “On Covering: Queerness.” 2020. Web. 19 Sep 2020.

Vancouver:

Rogers, Donald Wayne I. On Covering: Queerness. [Internet] [Masters thesis]. Virginia Tech; 2020. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10919/99909.

Council of Science Editors:

Rogers, Donald Wayne I. On Covering: Queerness. [Masters Thesis]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/99909

Vanderbilt University

7. Schroeder, Justin Zane. Hamilton cycle embeddings of complete tripartite graphs and their applications.

Degree: PhD, Mathematics, 2012, Vanderbilt University

URL: http://hdl.handle.net/1803/10927

► A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph <i>G</i>. For a general graph <i>G</i>, this…
(more)

Subjects/Keywords: covering triangulation; graph genus; graph embedding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schroeder, J. Z. (2012). Hamilton cycle embeddings of complete tripartite graphs and their applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/10927

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

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed September 19, 2020. http://hdl.handle.net/1803/10927.

MLA Handbook (7^{th} Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Web. 19 Sep 2020.

Vancouver:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1803/10927.

Council of Science Editors:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://hdl.handle.net/1803/10927

8. Bossenger, Wayne. 2D irregular strip packing at Kohler signs.

Degree: MCom, Economics, 2014, Stellenbosch University

URL: http://hdl.handle.net/10019.1/96129

►

ENGLISH ABSTRACT: Kohler Signs (PTY) Ltd is a sign production company located in Cape Town, South Africa. They manufacture and install signs for the City… (more)

Subjects/Keywords: Economics; Street signs; Combinatorial packing and covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bossenger, W. (2014). 2D irregular strip packing at Kohler signs. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/96129

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

Bossenger, Wayne. “2D irregular strip packing at Kohler signs.” 2014. Thesis, Stellenbosch University. Accessed September 19, 2020. http://hdl.handle.net/10019.1/96129.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bossenger, Wayne. “2D irregular strip packing at Kohler signs.” 2014. Web. 19 Sep 2020.

Vancouver:

Bossenger W. 2D irregular strip packing at Kohler signs. [Internet] [Thesis]. Stellenbosch University; 2014. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10019.1/96129.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bossenger W. 2D irregular strip packing at Kohler signs. [Thesis]. Stellenbosch University; 2014. Available from: http://hdl.handle.net/10019.1/96129

Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester

9. Kautz, Henry Alexander (1956 - ). A Formal theory of plan recognition.

Degree: PhD, 2009, University of Rochester

URL: http://hdl.handle.net/1802/6397

► Research in discourse analysis, story understanding, and user modeling for expert systems has shown great interest in plan recognition problems. In a plan recognition problem,…
(more)

Subjects/Keywords: Minimum covering entailment; Plan recognition; Inference

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kautz, H. A. (. -. ). (2009). A Formal theory of plan recognition. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/6397

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

Kautz, Henry Alexander (1956 - ). “A Formal theory of plan recognition.” 2009. Doctoral Dissertation, University of Rochester. Accessed September 19, 2020. http://hdl.handle.net/1802/6397.

MLA Handbook (7^{th} Edition):

Kautz, Henry Alexander (1956 - ). “A Formal theory of plan recognition.” 2009. Web. 19 Sep 2020.

Vancouver:

Kautz HA(-). A Formal theory of plan recognition. [Internet] [Doctoral dissertation]. University of Rochester; 2009. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1802/6397.

Council of Science Editors:

Kautz HA(-). A Formal theory of plan recognition. [Doctoral Dissertation]. University of Rochester; 2009. Available from: http://hdl.handle.net/1802/6397

Universidade Nova

10.
Buezas, David.
Constraint-based modeling of minimum set *covering*: application to species differentation.

Degree: 2011, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

►

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics

A large… (more)

Subjects/Keywords: Minimum set covering; Enzymes; Species differentiation; Constraints

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buezas, D. (2011). Constraint-based modeling of minimum set covering: application to species differentation. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

Not specified: Masters Thesis or Doctoral Dissertation

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

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Thesis, Universidade Nova. Accessed September 19, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Web. 19 Sep 2020.

Vancouver:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2020 Sep 19]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

Not specified: Masters Thesis or Doctoral Dissertation

Tulane University

11. Zhang, Dejun. Topological Galois theory of Riemann surfaces.

Degree: 2020, Tulane University

URL: https://digitallibrary.tulane.edu/islandora/object/tulane:120548

►

There is a deep analogy between the theory of *covering* spaces and the theory offield extensions. Indeed, for many theorems about the Galois groups…
(more)

Subjects/Keywords: covering spaces; Galois correspondence; Riemann surfaces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, D. (2020). Topological Galois theory of Riemann surfaces. (Thesis). Tulane University. Retrieved from https://digitallibrary.tulane.edu/islandora/object/tulane:120548

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Dejun. “Topological Galois theory of Riemann surfaces.” 2020. Thesis, Tulane University. Accessed September 19, 2020. https://digitallibrary.tulane.edu/islandora/object/tulane:120548.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Dejun. “Topological Galois theory of Riemann surfaces.” 2020. Web. 19 Sep 2020.

Vancouver:

Zhang D. Topological Galois theory of Riemann surfaces. [Internet] [Thesis]. Tulane University; 2020. [cited 2020 Sep 19]. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:120548.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang D. Topological Galois theory of Riemann surfaces. [Thesis]. Tulane University; 2020. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:120548

Not specified: Masters Thesis or Doctoral Dissertation

Rice University

12. Arellano, John David. Algorithms to Find the Girth and Cogirth of a Linear Matroid.

Degree: PhD, Engineering, 2014, Rice University

URL: http://hdl.handle.net/1911/87699

► In this thesis, I present algorithms to find the cogirth and girth, the cardinality of the smallest cocircuit and circuit respectively, of a linear matroid.…
(more)

Subjects/Keywords: set covering; linear matroid; cogirth; girth

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arellano, J. D. (2014). Algorithms to Find the Girth and Cogirth of a Linear Matroid. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87699

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

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Doctoral Dissertation, Rice University. Accessed September 19, 2020. http://hdl.handle.net/1911/87699.

MLA Handbook (7^{th} Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Web. 19 Sep 2020.

Vancouver:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1911/87699.

Council of Science Editors:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87699

University of Minnesota

13.
McGahan, Ian.
* Covering* cover pebbling number of products of paths.

Degree: MS, Applied and Computational Mathematics, 2015, University of Minnesota

URL: http://hdl.handle.net/11299/174812

► There are a variety of pebbling numbers, such as classical pebbling number, cover pebbling number, and *covering* cover pebbling number. In this paper we determine…
(more)

Subjects/Keywords: Cartesian Product; Cover; Covering; Path; Pebbling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McGahan, I. (2015). Covering cover pebbling number of products of paths. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/174812

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

McGahan, Ian. “Covering cover pebbling number of products of paths.” 2015. Masters Thesis, University of Minnesota. Accessed September 19, 2020. http://hdl.handle.net/11299/174812.

MLA Handbook (7^{th} Edition):

McGahan, Ian. “Covering cover pebbling number of products of paths.” 2015. Web. 19 Sep 2020.

Vancouver:

McGahan I. Covering cover pebbling number of products of paths. [Internet] [Masters thesis]. University of Minnesota; 2015. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/11299/174812.

Council of Science Editors:

McGahan I. Covering cover pebbling number of products of paths. [Masters Thesis]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/174812

14.
Garcia, Jacob D.
Some aspects of generalized *covering* space theory.

Degree: Thesis (M.S.), 2018, Ball State University

URL: http://cardinalscholar.bsu.edu/handle/123456789/201134

► *Covering* space theory is a classical tool used to characterize the geometry and topology of real or abstract spaces. It seeks to separate the main…
(more)

Subjects/Keywords: Covering spaces (Topology); Transfer (Algebraic topology)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garcia, J. D. (2018). Some aspects of generalized covering space theory. (Masters Thesis). Ball State University. Retrieved from http://cardinalscholar.bsu.edu/handle/123456789/201134

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

Garcia, Jacob D. “Some aspects of generalized covering space theory.” 2018. Masters Thesis, Ball State University. Accessed September 19, 2020. http://cardinalscholar.bsu.edu/handle/123456789/201134.

MLA Handbook (7^{th} Edition):

Garcia, Jacob D. “Some aspects of generalized covering space theory.” 2018. Web. 19 Sep 2020.

Vancouver:

Garcia JD. Some aspects of generalized covering space theory. [Internet] [Masters thesis]. Ball State University; 2018. [cited 2020 Sep 19]. Available from: http://cardinalscholar.bsu.edu/handle/123456789/201134.

Council of Science Editors:

Garcia JD. Some aspects of generalized covering space theory. [Masters Thesis]. Ball State University; 2018. Available from: http://cardinalscholar.bsu.edu/handle/123456789/201134

University of Lethbridge

15.
University of Lethbridge. Faculty of Arts and Science.
Investigations on two classes of *covering* problems
.

Degree: 2017, University of Lethbridge

URL: http://hdl.handle.net/10133/4774

► *Covering* problems fall within the broader category of facility location, a branch of combinatorial optimization concerned with the optimal placement of service facilities in some…
(more)

Subjects/Keywords: approximation algorithms; covering problems; facility location

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Science, U. o. L. F. o. A. a. (2017). Investigations on two classes of covering problems . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/4774

Not specified: Masters Thesis or Doctoral Dissertation

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

Science, University of Lethbridge. Faculty of Arts and. “Investigations on two classes of covering problems .” 2017. Thesis, University of Lethbridge. Accessed September 19, 2020. http://hdl.handle.net/10133/4774.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Investigations on two classes of covering problems .” 2017. Web. 19 Sep 2020.

Vancouver:

Science UoLFoAa. Investigations on two classes of covering problems . [Internet] [Thesis]. University of Lethbridge; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10133/4774.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Investigations on two classes of covering problems . [Thesis]. University of Lethbridge; 2017. Available from: http://hdl.handle.net/10133/4774

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

16.
Puleo, Gregory.
Problems in list coloring, triangle *covering*, and pursuit-evasion games.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50548

► We study several problems in extremal graph theory. Chapter 2 studies Tuza's Conjecture, which states that if a graph G does not contain more than…
(more)

Subjects/Keywords: Tuza's conjecture; packing and covering; list coloring; pursuit-evasion games; discharging; triangle packing; triangle covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Puleo, G. (2014). Problems in list coloring, triangle covering, and pursuit-evasion games. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50548

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

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 19, 2020. http://hdl.handle.net/2142/50548.

MLA Handbook (7^{th} Edition):

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Web. 19 Sep 2020.

Vancouver:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2142/50548.

Council of Science Editors:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50548

Indian Institute of Science

17.
Datta Krupa, R.
Generalization of Hitting, *Covering* and Packing Problems on Intervals.

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

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

► Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to…
(more)

Subjects/Keywords: Geometric Hitting Problem; Geometric Covering Problem; Geometric Packing Problem; Hitting Set; Covering Set; Pack Points; Interval Graphs; k-pack Points; Demand-hitting Problem; Demand-covering Problem; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Datta Krupa, R. (2018). Generalization of Hitting, Covering and Packing Problems on Intervals. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3628

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

Datta Krupa, R. “Generalization of Hitting, Covering and Packing Problems on Intervals.” 2018. Masters Thesis, Indian Institute of Science. Accessed September 19, 2020. http://etd.iisc.ac.in/handle/2005/3628.

MLA Handbook (7^{th} Edition):

Datta Krupa, R. “Generalization of Hitting, Covering and Packing Problems on Intervals.” 2018. Web. 19 Sep 2020.

Vancouver:

Datta Krupa R. Generalization of Hitting, Covering and Packing Problems on Intervals. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2020 Sep 19]. Available from: http://etd.iisc.ac.in/handle/2005/3628.

Council of Science Editors:

Datta Krupa R. Generalization of Hitting, Covering and Packing Problems on Intervals. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3628

North Carolina State University

18. Li, Xiao Yu. Optimization Algorithms for the Minimum-Cost Satisability Problem.

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

URL: http://www.lib.ncsu.edu/resolver/1840.16/4594

► Given a Boolean satisability (Sat) problem whose variables have non-negative weights, the minimum-cost satisability (MinCostSat) problem finds a satisfying truth assignment that minimizes a weighted…
(more)

Subjects/Keywords: SAT; Min-SAT; Binate covering; Optimization; Unate covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, X. Y. (2004). Optimization Algorithms for the Minimum-Cost Satisability Problem. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4594

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

Li, Xiao Yu. “Optimization Algorithms for the Minimum-Cost Satisability Problem.” 2004. Doctoral Dissertation, North Carolina State University. Accessed September 19, 2020. http://www.lib.ncsu.edu/resolver/1840.16/4594.

MLA Handbook (7^{th} Edition):

Li, Xiao Yu. “Optimization Algorithms for the Minimum-Cost Satisability Problem.” 2004. Web. 19 Sep 2020.

Vancouver:

Li XY. Optimization Algorithms for the Minimum-Cost Satisability Problem. [Internet] [Doctoral dissertation]. North Carolina State University; 2004. [cited 2020 Sep 19]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4594.

Council of Science Editors:

Li XY. Optimization Algorithms for the Minimum-Cost Satisability Problem. [Doctoral Dissertation]. North Carolina State University; 2004. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4594

The Ohio State University

19.
Bezdek, Andras.
Packing and *covering* problems.

Degree: PhD, Graduate School, 1986, The Ohio State University

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

Subjects/Keywords: Mathematics; Combinatorial packing and covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bezdek, A. (1986). Packing and covering problems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136

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

Bezdek, Andras. “Packing and covering problems.” 1986. Doctoral Dissertation, The Ohio State University. Accessed September 19, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.

MLA Handbook (7^{th} Edition):

Bezdek, Andras. “Packing and covering problems.” 1986. Web. 19 Sep 2020.

Vancouver:

Bezdek A. Packing and covering problems. [Internet] [Doctoral dissertation]. The Ohio State University; 1986. [cited 2020 Sep 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.

Council of Science Editors:

Bezdek A. Packing and covering problems. [Doctoral Dissertation]. The Ohio State University; 1986. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136

The Ohio State University

20. Games, Richard Alan. The packing problem for finite projective geometries .

Degree: PhD, Graduate School, 1980, The Ohio State University

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

Subjects/Keywords: Mathematics; Combinatorial packing and covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Games, R. A. (1980). The packing problem for finite projective geometries . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487092293068192

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

Games, Richard Alan. “The packing problem for finite projective geometries .” 1980. Doctoral Dissertation, The Ohio State University. Accessed September 19, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487092293068192.

MLA Handbook (7^{th} Edition):

Games, Richard Alan. “The packing problem for finite projective geometries .” 1980. Web. 19 Sep 2020.

Vancouver:

Games RA. The packing problem for finite projective geometries . [Internet] [Doctoral dissertation]. The Ohio State University; 1980. [cited 2020 Sep 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487092293068192.

Council of Science Editors:

Games RA. The packing problem for finite projective geometries . [Doctoral Dissertation]. The Ohio State University; 1980. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487092293068192

University of Utah

21. Shiu, Shang-Yuan. Probability on discrete structures.

Degree: PhD, Mathematics;, 2010, University of Utah

URL: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/216/rec/931

► This dissertation contains the solutions to two problems. The first problem concerns probability on trees. The second is a *covering* problem. Several different probability problems…
(more)

Subjects/Keywords: Covering problem; Optimal reward; Tree-indexed process; Discrete structures

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shiu, S. (2010). Probability on discrete structures. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/216/rec/931

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

Shiu, Shang-Yuan. “Probability on discrete structures.” 2010. Doctoral Dissertation, University of Utah. Accessed September 19, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/216/rec/931.

MLA Handbook (7^{th} Edition):

Shiu, Shang-Yuan. “Probability on discrete structures.” 2010. Web. 19 Sep 2020.

Vancouver:

Shiu S. Probability on discrete structures. [Internet] [Doctoral dissertation]. University of Utah; 2010. [cited 2020 Sep 19]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/216/rec/931.

Council of Science Editors:

Shiu S. Probability on discrete structures. [Doctoral Dissertation]. University of Utah; 2010. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/216/rec/931

University of Alabama

22. Acharyya, Amrita. Coverings of profinite graphs.

Degree: 2013, University of Alabama

URL: http://purl.lib.ua.edu/97278

► We define a *covering* of a profinite graph to be a projective limit of a system of *covering* maps of finite graphs. With this notion…
(more)

Subjects/Keywords: Electronic Thesis or Dissertation; – thesis; Mathematics; Covering space; Graphs; Groups; Profinite

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Acharyya, A. (2013). Coverings of profinite graphs. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/97278

Not specified: Masters Thesis or Doctoral Dissertation

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

Acharyya, Amrita. “Coverings of profinite graphs.” 2013. Thesis, University of Alabama. Accessed September 19, 2020. http://purl.lib.ua.edu/97278.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Acharyya, Amrita. “Coverings of profinite graphs.” 2013. Web. 19 Sep 2020.

Vancouver:

Acharyya A. Coverings of profinite graphs. [Internet] [Thesis]. University of Alabama; 2013. [cited 2020 Sep 19]. Available from: http://purl.lib.ua.edu/97278.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Acharyya A. Coverings of profinite graphs. [Thesis]. University of Alabama; 2013. Available from: http://purl.lib.ua.edu/97278

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

23. Chen, Cheng. Control and collective intelligence of multi-agent system.

Degree: PhD, Mechanical Engineering, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/101132

► Distributed artificial intelligence (DAI) and multi-agent system (MAS) has recently gained increasing interest due to its vast applications in real-world problems. Inspired by the natural…
(more)

Subjects/Keywords: Control; Multi-agent System; Cyclic Pursuit; Swarm; Covering; Topological Configuration Space

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, C. (2018). Control and collective intelligence of multi-agent system. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101132

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

Chen, Cheng. “Control and collective intelligence of multi-agent system.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 19, 2020. http://hdl.handle.net/2142/101132.

MLA Handbook (7^{th} Edition):

Chen, Cheng. “Control and collective intelligence of multi-agent system.” 2018. Web. 19 Sep 2020.

Vancouver:

Chen C. Control and collective intelligence of multi-agent system. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/2142/101132.

Council of Science Editors:

Chen C. Control and collective intelligence of multi-agent system. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101132

Universitat Politècnica de València

24.
Avila George, Himer.
Constructing *Covering* Arrays using Parallel Computing and Grid Computing
.

Degree: 2012, Universitat Politècnica de València

URL: http://hdl.handle.net/10251/17027

► A good strategy to test a software component involves the generation of the whole set of cases that participate in its operation. While testing only…
(more)

Subjects/Keywords: Covering arrays; Parallel computing; Grid computing; Combinatorial optimization; Simulated annealing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Avila George, H. (2012). Constructing Covering Arrays using Parallel Computing and Grid Computing . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/17027

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

Avila George, Himer. “Constructing Covering Arrays using Parallel Computing and Grid Computing .” 2012. Doctoral Dissertation, Universitat Politècnica de València. Accessed September 19, 2020. http://hdl.handle.net/10251/17027.

MLA Handbook (7^{th} Edition):

Avila George, Himer. “Constructing Covering Arrays using Parallel Computing and Grid Computing .” 2012. Web. 19 Sep 2020.

Vancouver:

Avila George H. Constructing Covering Arrays using Parallel Computing and Grid Computing . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2012. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10251/17027.

Council of Science Editors:

Avila George H. Constructing Covering Arrays using Parallel Computing and Grid Computing . [Doctoral Dissertation]. Universitat Politècnica de València; 2012. Available from: http://hdl.handle.net/10251/17027

Technical University of Lisbon

25. Saturnino, Carlos Samuel dos Santos. Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura.

Degree: 2014, Technical University of Lisbon

URL: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/6980

►

Mestrado em Engenharia Agronómica - Instituto Superior de Agronomia

In the present work, the influence of the technique of direct *covering* with perforated polyethylene (PE)…
(more)

Subjects/Keywords: Daucus carota; cultivars; direct covering; polyethylene; growth; yield; earliness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saturnino, C. S. d. S. (2014). Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura. (Thesis). Technical University of Lisbon. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/6980

Not specified: Masters Thesis or Doctoral Dissertation

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

Saturnino, Carlos Samuel dos Santos. “Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura.” 2014. Thesis, Technical University of Lisbon. Accessed September 19, 2020. https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/6980.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Saturnino, Carlos Samuel dos Santos. “Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura.” 2014. Web. 19 Sep 2020.

Vancouver:

Saturnino CSdS. Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura. [Internet] [Thesis]. Technical University of Lisbon; 2014. [cited 2020 Sep 19]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/6980.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Saturnino CSdS. Influência da técnica de cobertura directa com um filme de polietileno perfurado na produtividade e precocidade de três cultivares de cenoura. [Thesis]. Technical University of Lisbon; 2014. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/6980

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

26. Hall, Brayton Bruno. A Language-Game Justification for Narrative in Historical Explanation.

Degree: MA, Philosophy, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/78239

► The problem of historical explanation consists in how historical facts are put together. No mere collection of facts constitutes an explanation: there must be some…
(more)

Subjects/Keywords: Philosophy; History; Explanation; Language; Narrative; Covering Law; Wittgenstein; Danto; Hempel; Kuhn

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hall, B. B. (2017). A Language-Game Justification for Narrative in Historical Explanation. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78239

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

Hall, Brayton Bruno. “A Language-Game Justification for Narrative in Historical Explanation.” 2017. Masters Thesis, Virginia Tech. Accessed September 19, 2020. http://hdl.handle.net/10919/78239.

MLA Handbook (7^{th} Edition):

Hall, Brayton Bruno. “A Language-Game Justification for Narrative in Historical Explanation.” 2017. Web. 19 Sep 2020.

Vancouver:

Hall BB. A Language-Game Justification for Narrative in Historical Explanation. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10919/78239.

Council of Science Editors:

Hall BB. A Language-Game Justification for Narrative in Historical Explanation. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78239

University of Ottawa

27.
Maltais, Elizabeth Jane.
Graph-dependent *Covering* Arrays and LYM Inequalities
.

Degree: 2016, University of Ottawa

URL: http://hdl.handle.net/10393/34434

► The problems we study in this thesis are all related to *covering* arrays. *Covering* arrays are combinatorial designs, widely used as templates for efficient interaction-testing…
(more)

Subjects/Keywords: covering array; LYM inequality; extremal set theory; graph-intersecting collection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maltais, E. J. (2016). Graph-dependent Covering Arrays and LYM Inequalities . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34434

Not specified: Masters Thesis or Doctoral Dissertation

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

Maltais, Elizabeth Jane. “Graph-dependent Covering Arrays and LYM Inequalities .” 2016. Thesis, University of Ottawa. Accessed September 19, 2020. http://hdl.handle.net/10393/34434.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Maltais, Elizabeth Jane. “Graph-dependent Covering Arrays and LYM Inequalities .” 2016. Web. 19 Sep 2020.

Vancouver:

Maltais EJ. Graph-dependent Covering Arrays and LYM Inequalities . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10393/34434.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maltais EJ. Graph-dependent Covering Arrays and LYM Inequalities . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34434

Not specified: Masters Thesis or Doctoral Dissertation

28. Wright, Duncan. D-spaces in infinite products of ordinals.

Degree: 2014, University of Northern Iowa

URL: https://scholarworks.uni.edu/etd/42

1 PDF file (v, 18 pages)
*Advisors/Committee Members: Adrienne Stanley.*

Subjects/Keywords: Numbers; Ordinal; Covering spaces (Topology)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wright, D. (2014). D-spaces in infinite products of ordinals. (Thesis). University of Northern Iowa. Retrieved from https://scholarworks.uni.edu/etd/42

Not specified: Masters Thesis or Doctoral Dissertation

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

Wright, Duncan. “D-spaces in infinite products of ordinals.” 2014. Thesis, University of Northern Iowa. Accessed September 19, 2020. https://scholarworks.uni.edu/etd/42.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wright, Duncan. “D-spaces in infinite products of ordinals.” 2014. Web. 19 Sep 2020.

Vancouver:

Wright D. D-spaces in infinite products of ordinals. [Internet] [Thesis]. University of Northern Iowa; 2014. [cited 2020 Sep 19]. Available from: https://scholarworks.uni.edu/etd/42.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wright D. D-spaces in infinite products of ordinals. [Thesis]. University of Northern Iowa; 2014. Available from: https://scholarworks.uni.edu/etd/42

Not specified: Masters Thesis or Doctoral Dissertation

California State Polytechnic University – Pomona

29. To, Paul-John Alonte. Tetris-Packing Problem With Maximizing Filled Grid Squares.

Degree: MS, Computer Science, 2006, California State Polytechnic University – Pomona

URL: http://hdl.handle.net/10211.3/116668

► Tetris is a classic video game invented by Alexey Pazhitnov, a Russian mathematician, in the 1980???s. A player starts out with an empty vertical game…
(more)

Subjects/Keywords: Tetris; Combinatorial packing and covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

To, P. A. (2006). Tetris-Packing Problem With Maximizing Filled Grid Squares. (Masters Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/116668

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

To, Paul-John Alonte. “Tetris-Packing Problem With Maximizing Filled Grid Squares.” 2006. Masters Thesis, California State Polytechnic University – Pomona. Accessed September 19, 2020. http://hdl.handle.net/10211.3/116668.

MLA Handbook (7^{th} Edition):

To, Paul-John Alonte. “Tetris-Packing Problem With Maximizing Filled Grid Squares.” 2006. Web. 19 Sep 2020.

Vancouver:

To PA. Tetris-Packing Problem With Maximizing Filled Grid Squares. [Internet] [Masters thesis]. California State Polytechnic University – Pomona; 2006. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10211.3/116668.

Council of Science Editors:

To PA. Tetris-Packing Problem With Maximizing Filled Grid Squares. [Masters Thesis]. California State Polytechnic University – Pomona; 2006. Available from: http://hdl.handle.net/10211.3/116668

30.
Niblett, Timothy John.
On the Development of a New Class of *Covering* Path Models.

Degree: 2016, University of California – eScholarship, University of California

URL: http://www.escholarship.org/uc/item/46w2r10j

► The basis of this dissertation work stems from the fact that if one examines system route maps for many bus transit systems in U.S. cities,…
(more)

Subjects/Keywords: Geography; Engineering; Operations research; Covering; Location; Loops; Routes; Tours; Transit

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Niblett, T. J. (2016). On the Development of a New Class of Covering Path Models. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/46w2r10j

Not specified: Masters Thesis or Doctoral Dissertation

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

Niblett, Timothy John. “On the Development of a New Class of Covering Path Models.” 2016. Thesis, University of California – eScholarship, University of California. Accessed September 19, 2020. http://www.escholarship.org/uc/item/46w2r10j.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Niblett, Timothy John. “On the Development of a New Class of Covering Path Models.” 2016. Web. 19 Sep 2020.

Vancouver:

Niblett TJ. On the Development of a New Class of Covering Path Models. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2020 Sep 19]. Available from: http://www.escholarship.org/uc/item/46w2r10j.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Niblett TJ. On the Development of a New Class of Covering Path Models. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/46w2r10j

Not specified: Masters Thesis or Doctoral Dissertation