Advanced search options

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

You searched for `subject:( greedy)`

.
Showing records 1 – 30 of
173 total matches.

Search Limiters

Dates

- 2015 – 2019 (70)
- 2010 – 2014 (67)
- 2005 – 2009 (35)

Degrees

- PhD (29)
- Docteur es (26)
- MS (20)

Country

- US (56)
- France (26)
- Canada (12)
- Czech Republic (11)

▼ Search Limiters

Anna University

1. Sudha S. Enhanced reliable and adaptive Routing models for networks on chip;.

Degree: Enhanced reliable and adaptive Routing models for networks on chip, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26114

►

The main objective of this research is to develop a reliable and newlineCongestion aware adaptive routing model to improve the performance of the newlineNetwork on… (more)

Subjects/Keywords: Greedy algorithm; Network on Chip

Record Details Similar Records

❌

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

APA (6^{th} Edition):

S, S. (2014). Enhanced reliable and adaptive Routing models for networks on chip;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26114

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

S, Sudha. “Enhanced reliable and adaptive Routing models for networks on chip;.” 2014. Thesis, Anna University. Accessed October 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/26114.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

S, Sudha. “Enhanced reliable and adaptive Routing models for networks on chip;.” 2014. Web. 15 Oct 2019.

Vancouver:

S S. Enhanced reliable and adaptive Routing models for networks on chip;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26114.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

S S. Enhanced reliable and adaptive Routing models for networks on chip;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26114

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

2. Huang, Zhi-Quan. Atomic structure and mechanical properties of of BC2N.

Degree: Master, Physics, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402

► Structural motifs for the BC2N superlattices were identified from a systematic search based on a *greedy* algorithm. Using a tree data structure, we have retrieved…
(more)

Subjects/Keywords: greedy algorithm; first principle; BC2N

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, Z. (2010). Atomic structure and mechanical properties of of BC2N. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Zhi-Quan. “Atomic structure and mechanical properties of of BC2N.” 2010. Thesis, NSYSU. Accessed October 15, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Zhi-Quan. “Atomic structure and mechanical properties of of BC2N.” 2010. Web. 15 Oct 2019.

Vancouver:

Huang Z. Atomic structure and mechanical properties of of BC2N. [Internet] [Thesis]. NSYSU; 2010. [cited 2019 Oct 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang Z. Atomic structure and mechanical properties of of BC2N. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

3. Cheng, Kuang-Ting. A Study on Equipment and Route Planning of Remote Fiber Test Systems.

Degree: Master, Information Management, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0111114-112526

► Equipment and route planning of remote fiber test systems, currently only designed manually, is quite labor intensive. Poor route planning will not only increases the…
(more)

Subjects/Keywords: Genetic; Greedy; Route Planning; RFTS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cheng, K. (2014). A Study on Equipment and Route Planning of Remote Fiber Test Systems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0111114-112526

Not specified: Masters Thesis or Doctoral Dissertation

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

Cheng, Kuang-Ting. “A Study on Equipment and Route Planning of Remote Fiber Test Systems.” 2014. Thesis, NSYSU. Accessed October 15, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0111114-112526.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cheng, Kuang-Ting. “A Study on Equipment and Route Planning of Remote Fiber Test Systems.” 2014. Web. 15 Oct 2019.

Vancouver:

Cheng K. A Study on Equipment and Route Planning of Remote Fiber Test Systems. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Oct 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0111114-112526.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheng K. A Study on Equipment and Route Planning of Remote Fiber Test Systems. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0111114-112526

Not specified: Masters Thesis or Doctoral Dissertation

Kent State University

4.
Sehgal, Rahul.
* Greedy* routing in a graph by aid of its spanning tree:
Experimental results and Analysis.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2009, Kent State University

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

► In wireless networks, *greedy* routing is a method of routing message from source to destination in which the current vertex, holding the message, sends…
(more)

Subjects/Keywords: Computer Science; Greedy Routing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sehgal, R. (2009). Greedy routing in a graph by aid of its spanning tree: Experimental results and Analysis. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1232166476

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

Sehgal, Rahul. “Greedy routing in a graph by aid of its spanning tree: Experimental results and Analysis.” 2009. Masters Thesis, Kent State University. Accessed October 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1232166476.

MLA Handbook (7^{th} Edition):

Sehgal, Rahul. “Greedy routing in a graph by aid of its spanning tree: Experimental results and Analysis.” 2009. Web. 15 Oct 2019.

Vancouver:

Sehgal R. Greedy routing in a graph by aid of its spanning tree: Experimental results and Analysis. [Internet] [Masters thesis]. Kent State University; 2009. [cited 2019 Oct 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1232166476.

Council of Science Editors:

Sehgal R. Greedy routing in a graph by aid of its spanning tree: Experimental results and Analysis. [Masters Thesis]. Kent State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1232166476

5. Moussa, Ibrahim. Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality.

Degree: Docteur es, Informatique, 2015, Amiens

URL: http://www.theses.fr/2015AMIE0009

►

Cette thèse s’intéresse à la résolution de problèmes d’optimisation combinatoires NP-difficiles en utilisant des méthodes de résolution approchées. Deux domaines d’application sont ciblés ici, d’une… (more)

Subjects/Keywords: Théorie des graphes; Greedy algoritm; Biclique; 005

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Moussa, I. (2015). Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality. (Doctoral Dissertation). Amiens. Retrieved from http://www.theses.fr/2015AMIE0009

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

Moussa, Ibrahim. “Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality.” 2015. Doctoral Dissertation, Amiens. Accessed October 15, 2019. http://www.theses.fr/2015AMIE0009.

MLA Handbook (7^{th} Edition):

Moussa, Ibrahim. “Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality.” 2015. Web. 15 Oct 2019.

Vancouver:

Moussa I. Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality. [Internet] [Doctoral dissertation]. Amiens; 2015. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2015AMIE0009.

Council of Science Editors:

Moussa I. Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication : Development a method to characterize the territorial inequality of environmental and social health inequality. [Doctoral Dissertation]. Amiens; 2015. Available from: http://www.theses.fr/2015AMIE0009

UCLA

6.
Larriva, Matthew Rudolph.
Semi-*Greedy* Construction of Oblique-Split Decision Trees.

Degree: Statistics, 2019, UCLA

URL: http://www.escholarship.org/uc/item/2w3950hh

► Classication and Regression Trees (CART) are a method of structured prediction widely used in machine learning. Favored for their robustness to non-linear relationships and interpretability…
(more)

Subjects/Keywords: Statistics; CART; Classification and Regression Trees; Classification Tree; Non-greedy; Regression Tree; Semi-greedy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Larriva, M. R. (2019). Semi-Greedy Construction of Oblique-Split Decision Trees. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/2w3950hh

Not specified: Masters Thesis or Doctoral Dissertation

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

Larriva, Matthew Rudolph. “Semi-Greedy Construction of Oblique-Split Decision Trees.” 2019. Thesis, UCLA. Accessed October 15, 2019. http://www.escholarship.org/uc/item/2w3950hh.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Larriva, Matthew Rudolph. “Semi-Greedy Construction of Oblique-Split Decision Trees.” 2019. Web. 15 Oct 2019.

Vancouver:

Larriva MR. Semi-Greedy Construction of Oblique-Split Decision Trees. [Internet] [Thesis]. UCLA; 2019. [cited 2019 Oct 15]. Available from: http://www.escholarship.org/uc/item/2w3950hh.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Larriva MR. Semi-Greedy Construction of Oblique-Split Decision Trees. [Thesis]. UCLA; 2019. Available from: http://www.escholarship.org/uc/item/2w3950hh

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

7.
Nelson, Jessica Lee.
* Greedy* Algorithms and Incoherent Systems.

Degree: PhD, Mathematics, 2011, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/1607

This dissertation concerns estimates on the size of sets that have small coherence among the elements, the latest best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.
*Advisors/Committee Members: Vladimir N Temlyakov.*

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Coherence; Greedy Algorithms; Incoherent Dictionary; Pure Greedy Algorithm; Redundant Dictionary

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nelson, J. L. (2011). Greedy Algorithms and Incoherent Systems. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/1607

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

Nelson, Jessica Lee. “Greedy Algorithms and Incoherent Systems.” 2011. Doctoral Dissertation, University of South Carolina. Accessed October 15, 2019. https://scholarcommons.sc.edu/etd/1607.

MLA Handbook (7^{th} Edition):

Nelson, Jessica Lee. “Greedy Algorithms and Incoherent Systems.” 2011. Web. 15 Oct 2019.

Vancouver:

Nelson JL. Greedy Algorithms and Incoherent Systems. [Internet] [Doctoral dissertation]. University of South Carolina; 2011. [cited 2019 Oct 15]. Available from: https://scholarcommons.sc.edu/etd/1607.

Council of Science Editors:

Nelson JL. Greedy Algorithms and Incoherent Systems. [Doctoral Dissertation]. University of South Carolina; 2011. Available from: https://scholarcommons.sc.edu/etd/1607

Brno University of Technology

8. Zemánek, Karel. Lokalizace a její vliv na další procesy v bezdrátové síti .

Degree: 2010, Brno University of Technology

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

► Tato diplomová práce se zabývá lokalizací a jejím vlivem na další procesy v bezdrátové síti. První kapitola je věnována studiu lokalizačních algoritmů v bezdrátových senzorových…
(more)

Subjects/Keywords: Lokalizace; bezdrátové senzorové sítě; Greedy perimetr stateless routing (GPSR); Lokalization in wireless senzor networ; Greedy perimetr stateless routing (GPSR)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zemánek, K. (2010). Lokalizace a její vliv na další procesy v bezdrátové síti . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/5528

Not specified: Masters Thesis or Doctoral Dissertation

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

Zemánek, Karel. “Lokalizace a její vliv na další procesy v bezdrátové síti .” 2010. Thesis, Brno University of Technology. Accessed October 15, 2019. http://hdl.handle.net/11012/5528.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zemánek, Karel. “Lokalizace a její vliv na další procesy v bezdrátové síti .” 2010. Web. 15 Oct 2019.

Vancouver:

Zemánek K. Lokalizace a její vliv na další procesy v bezdrátové síti . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/11012/5528.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zemánek K. Lokalizace a její vliv na další procesy v bezdrátové síti . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/5528

Not specified: Masters Thesis or Doctoral Dissertation

9.
Gao, Zheming.
Rescaled Pure *Greedy* Algorithm for Convex Optimization.

Degree: 2016, Texas A&M University

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

► In this thesis, we suggest a new algorithm for solving convex optimization problems in Banach spaces. This algorithm is based on a *greedy* strategy, and…
(more)

Subjects/Keywords: Greedy Algorithm; Convex Optimization

…recursively, using the dictionary D. Some methods, such as the Weak Chebychev
*Greedy* Algorithm, see… …derived as a convex combination of xm−1 and φm .
In this thesis, we introduce a new *greedy*… …presented technique is a generalization of
the recently introduced Rescaled Pure *Greedy* Algorithm… …J + 1, J + 2, . . . .
3. RESCALED PURE *GREEDY* STRATEGIES FOR CONVEX
OPTIMIZATION
3.1… …Rescaled Pure *Greedy* Algorithm (RPGA(co))
In this section, we describe our…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gao, Z. (2016). Rescaled Pure Greedy Algorithm for Convex Optimization. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157019

Not specified: Masters Thesis or Doctoral Dissertation

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

Gao, Zheming. “Rescaled Pure Greedy Algorithm for Convex Optimization.” 2016. Thesis, Texas A&M University. Accessed October 15, 2019. http://hdl.handle.net/1969.1/157019.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gao, Zheming. “Rescaled Pure Greedy Algorithm for Convex Optimization.” 2016. Web. 15 Oct 2019.

Vancouver:

Gao Z. Rescaled Pure Greedy Algorithm for Convex Optimization. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1969.1/157019.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gao Z. Rescaled Pure Greedy Algorithm for Convex Optimization. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157019

Not specified: Masters Thesis or Doctoral Dissertation

10.
Nguyen, Hao Thanh.
* Greedy* Strategies for Convex Minimization.

Degree: 2013, Texas A&M University

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

► We have investigated two *greedy* strategies for finding an approximation to the minimum of a convex function E, defined on a Hilbert space H. We…
(more)

Subjects/Keywords: greedy algorithms; convex optimization

…*Greedy*
Algorithm (WCGA) when they are used to find the minimum of a function E that… …the
general results about *greedy* algorithms and describe the two algorithms (OMP and… …problem in I
Rn , using *greedy*
based strategies. More precisely, the class of functions he… …be uniformly bounded as in [20].
18
3. *GREEDY* ALGORITHMS
3.1 Introduction… …*Greedy* algorithms were first introduced in non-linear approximation as a tool to
find the best…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nguyen, H. T. (2013). Greedy Strategies for Convex Minimization. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151372

Not specified: Masters Thesis or Doctoral Dissertation

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

Nguyen, Hao Thanh. “Greedy Strategies for Convex Minimization.” 2013. Thesis, Texas A&M University. Accessed October 15, 2019. http://hdl.handle.net/1969.1/151372.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nguyen, Hao Thanh. “Greedy Strategies for Convex Minimization.” 2013. Web. 15 Oct 2019.

Vancouver:

Nguyen HT. Greedy Strategies for Convex Minimization. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1969.1/151372.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nguyen HT. Greedy Strategies for Convex Minimization. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151372

Not specified: Masters Thesis or Doctoral Dissertation

Anna University

11. Sabeen S. Association rule mining using directed graphs and hypergraphs;.

Degree: Association rule mining using directed graphs and hypergraphs, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/39196

►

Data mining is a potential tool for prolific analysis of data The task of association rule mining in a large database is one of the… (more)

Subjects/Keywords: Data mining; Divide and conquer and a greedy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

S, S. (2015). Association rule mining using directed graphs and hypergraphs;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/39196

Not specified: Masters Thesis or Doctoral Dissertation

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

S, Sabeen. “Association rule mining using directed graphs and hypergraphs;.” 2015. Thesis, Anna University. Accessed October 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/39196.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

S, Sabeen. “Association rule mining using directed graphs and hypergraphs;.” 2015. Web. 15 Oct 2019.

Vancouver:

S S. Association rule mining using directed graphs and hypergraphs;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Oct 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39196.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

S S. Association rule mining using directed graphs and hypergraphs;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39196

Not specified: Masters Thesis or Doctoral Dissertation

12. Rasheed, Amer. Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers.

Degree: 2009, , School of Computing

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3398

Automated Guided Vehicles hav gained much attention in the industry especially with relevance to container handling at the seaports.

Subjects/Keywords: containers; greedy; automated guided vehicles; Software Engineering; Programvaruteknik

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rasheed, A. (2009). Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3398

Not specified: Masters Thesis or Doctoral Dissertation

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

Rasheed, Amer. “Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers.” 2009. Thesis, , School of Computing. Accessed October 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3398.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rasheed, Amer. “Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers.” 2009. Web. 15 Oct 2019.

Vancouver:

Rasheed A. Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers. [Internet] [Thesis]. , School of Computing; 2009. [cited 2019 Oct 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3398.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rasheed A. Dispatching strategies to evaluate performance for automated guided vehicles in the transport of containers. [Thesis]. , School of Computing; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3398

Not specified: Masters Thesis or Doctoral Dissertation

University of Cincinnati

13. Swami, Sameer. Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks.

Degree: MS, Engineering : Computer Science, 2008, University of Cincinnati

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

► In this thesis work, we focus on the design of a new channel allocation mechanism for the Cognitive Radio based xG networks, based on…
(more)

Subjects/Keywords: Computer Science; Cognitive radios; channel allocation; greedy priority optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Swami, S. (2008). Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863

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

Swami, Sameer. “Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks.” 2008. Masters Thesis, University of Cincinnati. Accessed October 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863.

MLA Handbook (7^{th} Edition):

Swami, Sameer. “Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks.” 2008. Web. 15 Oct 2019.

Vancouver:

Swami S. Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks. [Internet] [Masters thesis]. University of Cincinnati; 2008. [cited 2019 Oct 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863.

Council of Science Editors:

Swami S. Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks. [Masters Thesis]. University of Cincinnati; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863

University of Alberta

14. Afkanpour, Arash. Multiple Kernel Learning with Many Kernels.

Degree: PhD, Department of Computing Science, 2013, University of Alberta

URL: https://era.library.ualberta.ca/files/2z10wr20m

► Multiple kernel learning (MKL) addresses the problem of learning the kernel function from data. Since a kernel function is associated with an underlying feature space,…
(more)

Subjects/Keywords: Greedy Coordinate Descent; Multiple Kernel Learning; Stochastic Gradient Descent

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Afkanpour, A. (2013). Multiple Kernel Learning with Many Kernels. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/2z10wr20m

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

Afkanpour, Arash. “Multiple Kernel Learning with Many Kernels.” 2013. Doctoral Dissertation, University of Alberta. Accessed October 15, 2019. https://era.library.ualberta.ca/files/2z10wr20m.

MLA Handbook (7^{th} Edition):

Afkanpour, Arash. “Multiple Kernel Learning with Many Kernels.” 2013. Web. 15 Oct 2019.

Vancouver:

Afkanpour A. Multiple Kernel Learning with Many Kernels. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2019 Oct 15]. Available from: https://era.library.ualberta.ca/files/2z10wr20m.

Council of Science Editors:

Afkanpour A. Multiple Kernel Learning with Many Kernels. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/2z10wr20m

Penn State University

15.
Li, Zhenyao.
* Greedy* Algorithm for approximating maximum induced
matching.

Degree: MS, Computer Science and Engineering, 2014, Penn State University

URL: https://etda.libraries.psu.edu/catalog/22793

► An induced matching in a graph G=(V,E) is M\subseteq E such that it is a matching and also the edge set of an induced subgraph…
(more)

Subjects/Keywords: graph theory; combinatorial problem; approximation algorithms; induced matching; greedy algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Z. (2014). Greedy Algorithm for approximating maximum induced matching. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22793

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

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Masters Thesis, Penn State University. Accessed October 15, 2019. https://etda.libraries.psu.edu/catalog/22793.

MLA Handbook (7^{th} Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 15 Oct 2019.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 Oct 15]. Available from: https://etda.libraries.psu.edu/catalog/22793.

Council of Science Editors:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22793

Universidade Nova

16. Rodrigues, Pedro Miguel Fonseca. Scale-free networks and scalable interdomain routing.

Degree: 2010, Universidade Nova

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

►

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

The exponential growth of… (more)

Subjects/Keywords: Internet architecture; BGP; Routing schemes; Scale-free networks; Greedy routing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rodrigues, P. M. F. (2010). Scale-free networks and scalable interdomain routing. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4336

Not specified: Masters Thesis or Doctoral Dissertation

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

Rodrigues, Pedro Miguel Fonseca. “Scale-free networks and scalable interdomain routing.” 2010. Thesis, Universidade Nova. Accessed October 15, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4336.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rodrigues, Pedro Miguel Fonseca. “Scale-free networks and scalable interdomain routing.” 2010. Web. 15 Oct 2019.

Vancouver:

Rodrigues PMF. Scale-free networks and scalable interdomain routing. [Internet] [Thesis]. Universidade Nova; 2010. [cited 2019 Oct 15]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4336.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rodrigues PMF. Scale-free networks and scalable interdomain routing. [Thesis]. Universidade Nova; 2010. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4336

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

17. Burrowbridge, Sarah Elizabeth. Optimal Allocation of Satellite Network Resources.

Degree: MS, Mathematics, 1999, Virginia Tech

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

► This work examines a straightforward solution to a problem of satellite network resource allocation by exploring the application of an optimal algorithm to a subset…
(more)

Subjects/Keywords: Scheduler; Mission Planning; Greedy Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Burrowbridge, S. E. (1999). Optimal Allocation of Satellite Network Resources. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36385

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

Burrowbridge, Sarah Elizabeth. “Optimal Allocation of Satellite Network Resources.” 1999. Masters Thesis, Virginia Tech. Accessed October 15, 2019. http://hdl.handle.net/10919/36385.

MLA Handbook (7^{th} Edition):

Burrowbridge, Sarah Elizabeth. “Optimal Allocation of Satellite Network Resources.” 1999. Web. 15 Oct 2019.

Vancouver:

Burrowbridge SE. Optimal Allocation of Satellite Network Resources. [Internet] [Masters thesis]. Virginia Tech; 1999. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10919/36385.

Council of Science Editors:

Burrowbridge SE. Optimal Allocation of Satellite Network Resources. [Masters Thesis]. Virginia Tech; 1999. Available from: http://hdl.handle.net/10919/36385

18. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

► Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning…
(more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

Not specified: Masters Thesis or Doctoral Dissertation

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

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed October 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 15 Oct 2019.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2019 Oct 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

Not specified: Masters Thesis or Doctoral Dissertation

University of Lethbridge

19. University of Lethbridge. Faculty of Arts and Science. Semi-extractive multi-document summarization .

Degree: 2015, University of Lethbridge

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

► In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to…
(more)

Subjects/Keywords: greedy algorithm; knapsack; maximum coverage; multi-document; summarization

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. (2015). Semi-extractive multi-document summarization . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/3759

Not specified: Masters Thesis or Doctoral Dissertation

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

Science, University of Lethbridge. Faculty of Arts and. “Semi-extractive multi-document summarization .” 2015. Thesis, University of Lethbridge. Accessed October 15, 2019. http://hdl.handle.net/10133/3759.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Science, University of Lethbridge. Faculty of Arts and. “Semi-extractive multi-document summarization .” 2015. Web. 15 Oct 2019.

Vancouver:

Science UoLFoAa. Semi-extractive multi-document summarization . [Internet] [Thesis]. University of Lethbridge; 2015. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10133/3759.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Semi-extractive multi-document summarization . [Thesis]. University of Lethbridge; 2015. Available from: http://hdl.handle.net/10133/3759

Not specified: Masters Thesis or Doctoral Dissertation

IUPUI

20. Huang, Zhi. Vehicle sensor-based pedestrian position identification in V2V environment.

Degree: 2016, IUPUI

URL: http://hdl.handle.net/1805/11825

►

Indiana University-Purdue University Indianapolis (IUPUI)

This thesis presents a method to accurately determine the location and amount of pedestrians detected by different vehicles equipped with… (more)

Subjects/Keywords: Clustering methods; Greedy algorithms; Intelligent vehicles; Mathematical model; Vehicle detection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, Z. (2016). Vehicle sensor-based pedestrian position identification in V2V environment. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/11825

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Zhi. “Vehicle sensor-based pedestrian position identification in V2V environment.” 2016. Thesis, IUPUI. Accessed October 15, 2019. http://hdl.handle.net/1805/11825.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Zhi. “Vehicle sensor-based pedestrian position identification in V2V environment.” 2016. Web. 15 Oct 2019.

Vancouver:

Huang Z. Vehicle sensor-based pedestrian position identification in V2V environment. [Internet] [Thesis]. IUPUI; 2016. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1805/11825.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang Z. Vehicle sensor-based pedestrian position identification in V2V environment. [Thesis]. IUPUI; 2016. Available from: http://hdl.handle.net/1805/11825

Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

21. Clemens, Jason. Spanning tree modulus: deflation and a hierarchical graph structure.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

URL: http://hdl.handle.net/2097/39115

► The concept of discrete p-modulus provides a general framework for understanding arbitrary families of objects on a graph. The p-modulus provides a sense of ``structure''…
(more)

Subjects/Keywords: Modulus; Spanning tree; Minimum spanning trees; Graph structure; Greedy algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Clemens, J. (2018). Spanning tree modulus: deflation and a hierarchical graph structure. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39115

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

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Doctoral Dissertation, Kansas State University. Accessed October 15, 2019. http://hdl.handle.net/2097/39115.

MLA Handbook (7^{th} Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 15 Oct 2019.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/2097/39115.

Council of Science Editors:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/39115

University of South Carolina

22.
Zheltov, Pavel.
Additive Lebesgue-Type Inequalities for *Greedy* Approximation.

Degree: PhD, Mathematics, 2010, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/430

► In the approximation theory we are commonly interested in finding a best possible approximant to a function (also thought of as a signal or…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; algorithms; approximation; compressed; greedy; sensing; sparse

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zheltov, P. (2010). Additive Lebesgue-Type Inequalities for Greedy Approximation. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/430

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

Zheltov, Pavel. “Additive Lebesgue-Type Inequalities for Greedy Approximation.” 2010. Doctoral Dissertation, University of South Carolina. Accessed October 15, 2019. https://scholarcommons.sc.edu/etd/430.

MLA Handbook (7^{th} Edition):

Zheltov, Pavel. “Additive Lebesgue-Type Inequalities for Greedy Approximation.” 2010. Web. 15 Oct 2019.

Vancouver:

Zheltov P. Additive Lebesgue-Type Inequalities for Greedy Approximation. [Internet] [Doctoral dissertation]. University of South Carolina; 2010. [cited 2019 Oct 15]. Available from: https://scholarcommons.sc.edu/etd/430.

Council of Science Editors:

Zheltov P. Additive Lebesgue-Type Inequalities for Greedy Approximation. [Doctoral Dissertation]. University of South Carolina; 2010. Available from: https://scholarcommons.sc.edu/etd/430

University of South Carolina

23.
Dereventsov, Anton.
Convergence and Rate of Convergence of Approximate *Greedy*-Type Algorithms.

Degree: PhD, Mathematics, 2017, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/4319

► In this dissertation we study the questions of convergence and rate of convergence of *greedy*-type algorithms under imprecise step evaluations. Such algorithms are in…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Greedy-Type Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dereventsov, A. (2017). Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/4319

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

Dereventsov, Anton. “Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms.” 2017. Doctoral Dissertation, University of South Carolina. Accessed October 15, 2019. https://scholarcommons.sc.edu/etd/4319.

MLA Handbook (7^{th} Edition):

Dereventsov, Anton. “Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms.” 2017. Web. 15 Oct 2019.

Vancouver:

Dereventsov A. Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms. [Internet] [Doctoral dissertation]. University of South Carolina; 2017. [cited 2019 Oct 15]. Available from: https://scholarcommons.sc.edu/etd/4319.

Council of Science Editors:

Dereventsov A. Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms. [Doctoral Dissertation]. University of South Carolina; 2017. Available from: https://scholarcommons.sc.edu/etd/4319

Utah State University

24. Li, Shimin. Geometric Algorithms for Intervals and Related Problems.

Degree: PhD, Computer Science, 2018, Utah State University

URL: https://digitalcommons.usu.edu/etd/7035

► In this dissertation, we study several problems related to intervals and develop efficient algorithms for them. Interval problems have many applications in reality because…
(more)

Subjects/Keywords: computational geometry; algorithms; intervals; greedy technique; min-max; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, S. (2018). Geometric Algorithms for Intervals and Related Problems. (Doctoral Dissertation). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/7035

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

Li, Shimin. “Geometric Algorithms for Intervals and Related Problems.” 2018. Doctoral Dissertation, Utah State University. Accessed October 15, 2019. https://digitalcommons.usu.edu/etd/7035.

MLA Handbook (7^{th} Edition):

Li, Shimin. “Geometric Algorithms for Intervals and Related Problems.” 2018. Web. 15 Oct 2019.

Vancouver:

Li S. Geometric Algorithms for Intervals and Related Problems. [Internet] [Doctoral dissertation]. Utah State University; 2018. [cited 2019 Oct 15]. Available from: https://digitalcommons.usu.edu/etd/7035.

Council of Science Editors:

Li S. Geometric Algorithms for Intervals and Related Problems. [Doctoral Dissertation]. Utah State University; 2018. Available from: https://digitalcommons.usu.edu/etd/7035

University of Guelph

25.
Sala, Evan.
Exploring the *Greedy* Constructions of de Bruijn Sequences
.

Degree: 2018, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

► A k-ary de Bruijn sequence of order n is a cyclic sequence of length k^n such that each k-ary string of length n appears exactly…
(more)

Subjects/Keywords: de Bruijn Sequence; de Bruijn Graph; Greedy Algorithm; Sequence Construction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sala, E. (2018). Exploring the Greedy Constructions of de Bruijn Sequences . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

Not specified: Masters Thesis or Doctoral Dissertation

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

Sala, Evan. “Exploring the Greedy Constructions of de Bruijn Sequences .” 2018. Thesis, University of Guelph. Accessed October 15, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sala, Evan. “Exploring the Greedy Constructions of de Bruijn Sequences .” 2018. Web. 15 Oct 2019.

Vancouver:

Sala E. Exploring the Greedy Constructions of de Bruijn Sequences . [Internet] [Thesis]. University of Guelph; 2018. [cited 2019 Oct 15]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sala E. Exploring the Greedy Constructions of de Bruijn Sequences . [Thesis]. University of Guelph; 2018. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/13012

Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

26.
Jing, Yaohui.
On the Optimality of the *Greedy* Policy for Battery Limited Energy Harvesting Communications.

Degree: MASc, 2019, McMaster University

URL: http://hdl.handle.net/11375/24666

►

Wireless network for connecting the devices and sensors to communicate and sense is quite attractive nowadays for a wide range of applications. The scaling of… (more)

Subjects/Keywords: Bellman equation; Energy harvesting; Greedy policy; Power control; Throughput

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jing, Y. (2019). On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/24666

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

Jing, Yaohui. “On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications.” 2019. Masters Thesis, McMaster University. Accessed October 15, 2019. http://hdl.handle.net/11375/24666.

MLA Handbook (7^{th} Edition):

Jing, Yaohui. “On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications.” 2019. Web. 15 Oct 2019.

Vancouver:

Jing Y. On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications. [Internet] [Masters thesis]. McMaster University; 2019. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/11375/24666.

Council of Science Editors:

Jing Y. On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications. [Masters Thesis]. McMaster University; 2019. Available from: http://hdl.handle.net/11375/24666

Ohio University

27. Jones, Jeffrey S. Analysis of Algorithms for Star Bicoloring and Related Problems.

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

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

► This dissertation considers certain graph-theoretic combinatorial problems which have direct application to the efficient computation of derivative matrices (“Jacobians”) which arise in many scientific computing…
(more)

Subjects/Keywords: Applied Mathematics; Computer Science; star bicoloring; acyclic bicoloring; Jacobian matrix computation; approximation algorithms; greedy star bicoloring; Jacobian matrix optimization; greedy optimization methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jones, J. S. (2015). Analysis of Algorithms for Star Bicoloring and Related Problems. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1426770501

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

Jones, Jeffrey S. “Analysis of Algorithms for Star Bicoloring and Related Problems.” 2015. Doctoral Dissertation, Ohio University. Accessed October 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1426770501.

MLA Handbook (7^{th} Edition):

Jones, Jeffrey S. “Analysis of Algorithms for Star Bicoloring and Related Problems.” 2015. Web. 15 Oct 2019.

Vancouver:

Jones JS. Analysis of Algorithms for Star Bicoloring and Related Problems. [Internet] [Doctoral dissertation]. Ohio University; 2015. [cited 2019 Oct 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1426770501.

Council of Science Editors:

Jones JS. Analysis of Algorithms for Star Bicoloring and Related Problems. [Doctoral Dissertation]. Ohio University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1426770501

28. Chira, Liviu-Teodor. Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm.

Degree: Docteur es, Sciences de la Vie et de la Santé, 2013, Tours; Universitatea tehnica (Cluj-Napoca, Roumanie)

URL: http://www.theses.fr/2013TOUR3311

►

L'imagerie médicale ultrasonore est une modalité en perpétuelle évolution et notamment en post-traitement où il s'agit d'améliorer la résolution et le contraste des images. Ces… (more)

Subjects/Keywords: Imagerie ultrasonore; Post traitement; Déconvolution aveugle; Algorithme greedy; Matching Pursuit; Parcimonie; CLEAN adaptatif; Ultrasound imaging; Postprocessing; Blind deconvolution; Greedy algorithm; Matching Pursuit; Sparsity; Adaptive CLEAN

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chira, L. (2013). Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm. (Doctoral Dissertation). Tours; Universitatea tehnica (Cluj-Napoca, Roumanie). Retrieved from http://www.theses.fr/2013TOUR3311

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

Chira, Liviu-Teodor. “Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm.” 2013. Doctoral Dissertation, Tours; Universitatea tehnica (Cluj-Napoca, Roumanie). Accessed October 15, 2019. http://www.theses.fr/2013TOUR3311.

MLA Handbook (7^{th} Edition):

Chira, Liviu-Teodor. “Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm.” 2013. Web. 15 Oct 2019.

Vancouver:

Chira L. Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm. [Internet] [Doctoral dissertation]. Tours; Universitatea tehnica (Cluj-Napoca, Roumanie); 2013. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2013TOUR3311.

Council of Science Editors:

Chira L. Déconvolution aveugle parcimonieuse en imagerie échographique avec un algorithme CLEAN adaptatif : Sparse blind deconvolution in ultrasound imaging using an adaptative CLEAN algorithm. [Doctoral Dissertation]. Tours; Universitatea tehnica (Cluj-Napoca, Roumanie); 2013. Available from: http://www.theses.fr/2013TOUR3311

29. Ahmed, Fareed. Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model.

Degree: Docteur es, Informatique, 2014, Université François-Rabelais de Tours

URL: http://www.theses.fr/2014TOUR4008

►

Les contours actifs sont parmi les méthodes de segmentation d'images les plus utilisées et de nombreuses implémentations ont vu le jour durant ces 25 dernières… (more)

Subjects/Keywords: Contours actifs; Modèles déformables; A priori de formes; Algorithme greedy; Segmentation d'images; Invariants; Descripteurs de Fourier; Active contours; Deformable models; Shape priors; Greedy algorithm; Image segmentation; Invariants; Fourier descriptors; Snakes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ahmed, F. (2014). Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2014TOUR4008

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

Ahmed, Fareed. “Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model.” 2014. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed October 15, 2019. http://www.theses.fr/2014TOUR4008.

MLA Handbook (7^{th} Edition):

Ahmed, Fareed. “Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model.” 2014. Web. 15 Oct 2019.

Vancouver:

Ahmed F. Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2014. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2014TOUR4008.

Council of Science Editors:

Ahmed F. Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2014. Available from: http://www.theses.fr/2014TOUR4008

Brno University of Technology

30. Ščišľak, Tomáš. Generátor sítě konečných prvků .

Degree: 2011, Brno University of Technology

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

► V úvodu práce jsou popsány základní kroky metody konečných prvků. Dále se zde pojednává o základních vlastnostech metod triangulace. Pozornost je zaměřena především na Delaunay…
(more)

Subjects/Keywords: Metoda konečných prvkú; Diskretizace; Aproximace funkce; Reziduum; Greedy a Delaunay triangulace; Koeficient dělení .; Finite element method; Discretization; Approximate function; Residue; Greedy and Delaunay triangulation; Scalefactor.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ščišľak, T. (2011). Generátor sítě konečných prvků . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/7164

Not specified: Masters Thesis or Doctoral Dissertation

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

Ščišľak, Tomáš. “Generátor sítě konečných prvků .” 2011. Thesis, Brno University of Technology. Accessed October 15, 2019. http://hdl.handle.net/11012/7164.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ščišľak, Tomáš. “Generátor sítě konečných prvků .” 2011. Web. 15 Oct 2019.

Vancouver:

Ščišľak T. Generátor sítě konečných prvků . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/11012/7164.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ščišľak T. Generátor sítě konečných prvků . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/7164

Not specified: Masters Thesis or Doctoral Dissertation