Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Greedy algorithm). Showing records 1 – 30 of 75 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Country

▼ 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

S, Sudha. “Enhanced reliable and adaptive Routing models for networks on chip;.” 2014. Thesis, Anna University. Accessed October 23, 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 (7th Edition):

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

Vancouver:

S S. Enhanced reliable and adaptive Routing models for networks on chip;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 23]. 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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

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

Degree: Computer Engineering, 2010, Dalarna University

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of South Carolina

4. Nelson, Jessica Lee. Greedy Algorithms and Incoherent Systems.

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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Nelson JL. Greedy Algorithms and Incoherent Systems. [Internet] [Doctoral dissertation]. University of South Carolina; 2011. [cited 2019 Oct 23]. 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

5. Gao, Zheming. Rescaled Pure Greedy Algorithm for Convex Optimization.

Degree: 2016, Texas A&M University

 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… …presented technique is a generalization of the recently introduced Rescaled Pure Greedy Algorithm… …Rescaled Pure Greedy Algorithm (RPGA(co)) In this section, we describe our… …α, E, µ). 12 3.2 The Weak Rescaled Pure Greedy Algorithm (WRPGA(co)… …latter was suggested as a modification to the Pure Greedy Algorithm, known also as Matching… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Virginia Tech

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

Degree: MS, Mathematics, 1999, Virginia Tech

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Burrowbridge SE. Optimal Allocation of Satellite Network Resources. [Internet] [Masters thesis]. Virginia Tech; 1999. [cited 2019 Oct 23]. 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


University of Lethbridge

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

Degree: 2015, University of Lethbridge

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


Kansas State University

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

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

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

MLA Handbook (7th Edition):

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

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Oct 23]. 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 Guelph

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

Degree: 2018, University of Guelph

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

10. Althoby, Haeder Younis Ghawi. Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.

Degree: Docteur es, Mathematiques, 2017, Normandie

Étant donné G = (V, E) un graphe non orienté connexe et un entier positif β (n), où n est le nombrede sommets de G,… (more)

Subjects/Keywords: Partitionnement; Séparation et évaluation; Combinatorial optimization; Partitioning graph; Heuristics; Greedy algorithm; Branch and bound algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Althoby, H. Y. G. (2017). Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. (Doctoral Dissertation). Normandie. Retrieved from http://www.theses.fr/2017NORMC233

Chicago Manual of Style (16th Edition):

Althoby, Haeder Younis Ghawi. “Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.” 2017. Doctoral Dissertation, Normandie. Accessed October 23, 2019. http://www.theses.fr/2017NORMC233.

MLA Handbook (7th Edition):

Althoby, Haeder Younis Ghawi. “Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe.” 2017. Web. 23 Oct 2019.

Vancouver:

Althoby HYG. Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. [Internet] [Doctoral dissertation]. Normandie; 2017. [cited 2019 Oct 23]. Available from: http://www.theses.fr/2017NORMC233.

Council of Science Editors:

Althoby HYG. Theoritical and numerical studies on the graph partitioning problem : Études théoriques et numériques du problème de partitionnement dans un graphe. [Doctoral Dissertation]. Normandie; 2017. Available from: http://www.theses.fr/2017NORMC233


Miami University

11. Li, Hui. Algorithms for the selection of optimal spaced seed sets for transposable element identification.

Degree: Master of Computer Science, Computer Science and Systems Analysis, 2010, Miami University

 Spaced seeds have proved to be invaluable in BLAST-like homology searches of large genomic sequences. But the problem of evaluating spaced seeds for this purpose… (more)

Subjects/Keywords: Bioinformatics; Computer Science; spaced seed set; genetic algorithm; hit probability; transposable element; greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, H. (2010). Algorithms for the selection of optimal spaced seed sets for transposable element identification. (Masters Thesis). Miami University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=miami1283178156

Chicago Manual of Style (16th Edition):

Li, Hui. “Algorithms for the selection of optimal spaced seed sets for transposable element identification.” 2010. Masters Thesis, Miami University. Accessed October 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=miami1283178156.

MLA Handbook (7th Edition):

Li, Hui. “Algorithms for the selection of optimal spaced seed sets for transposable element identification.” 2010. Web. 23 Oct 2019.

Vancouver:

Li H. Algorithms for the selection of optimal spaced seed sets for transposable element identification. [Internet] [Masters thesis]. Miami University; 2010. [cited 2019 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1283178156.

Council of Science Editors:

Li H. Algorithms for the selection of optimal spaced seed sets for transposable element identification. [Masters Thesis]. Miami University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1283178156

12. Lundquist, Josefin. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.

Degree: Mathematics and Mathematical Statistics, 2017, Umeå University

  A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products… (more)

Subjects/Keywords: Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lundquist, J. (2017). An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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

Chicago Manual of Style (16th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Thesis, Umeå University. Accessed October 23, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

MLA Handbook (7th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Web. 23 Oct 2019.

Vancouver:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Internet] [Thesis]. Umeå University; 2017. [cited 2019 Oct 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

Council of Science Editors:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Thesis]. Umeå University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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


Anna University

13. Sasikala R. Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;.

Degree: 2013, Anna University

The high performance computing models cloud, grid and utility computing are the different forms of distributed computing that allow users to tap into vast network… (more)

Subjects/Keywords: Proxies in optimal locations; Maximum Reduction Scheme (MRS) algorithm; Greedy-MRS; HRM network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

R, S. (2013). Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/13450

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

Chicago Manual of Style (16th Edition):

R, Sasikala. “Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;.” 2013. Thesis, Anna University. Accessed October 23, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/13450.

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

MLA Handbook (7th Edition):

R, Sasikala. “Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;.” 2013. Web. 23 Oct 2019.

Vancouver:

R S. Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;. [Internet] [Thesis]. Anna University; 2013. [cited 2019 Oct 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13450.

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

Council of Science Editors:

R S. Dynamic placement of proxies in optimal locations for router assisted hierarchical approach and hierarchical reliable multicast network;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13450

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


NSYSU

14. Chen, Cian-Hao. Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks.

Degree: Master, Electrical Engineering, 2017, NSYSU

 This thesis considers an application scenario in a cognitive vehicular network: The roadside unit (RSU) periodically broadcasts a number of data packets. The vehicles in… (more)

Subjects/Keywords: NP-complete; integer programming,; network coding; medium access control; greedy algorithm; Cognitive vehicular networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, C. (2017). Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-145853

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

Chicago Manual of Style (16th Edition):

Chen, Cian-Hao. “Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks.” 2017. Thesis, NSYSU. Accessed October 23, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-145853.

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

MLA Handbook (7th Edition):

Chen, Cian-Hao. “Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks.” 2017. Web. 23 Oct 2019.

Vancouver:

Chen C. Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 23]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-145853.

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

Council of Science Editors:

Chen C. Network-Coding-Assisted Cooperative MAC Protocols for Cognitive Vehicular Networks. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-145853

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

15. Moussallam, Manuel. Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes.

Degree: Docteur es, Signal et Images, 2012, Paris, ENST

L'objet de cette thèse est l'analyse et le traitement automatique de grands volumes de données audio. Plus particulièrement, on s'intéresse à l'archivage, tâche qui regroupe,… (more)

Subjects/Keywords: Empreintes acoustique; Algorithmes gloutons; Séparation de source; Fingerprint; Greedy algorithm; Audio source separation; Matching pursuit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moussallam, M. (2012). Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes. (Doctoral Dissertation). Paris, ENST. Retrieved from http://www.theses.fr/2012ENST0079

Chicago Manual of Style (16th Edition):

Moussallam, Manuel. “Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes.” 2012. Doctoral Dissertation, Paris, ENST. Accessed October 23, 2019. http://www.theses.fr/2012ENST0079.

MLA Handbook (7th Edition):

Moussallam, Manuel. “Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes.” 2012. Web. 23 Oct 2019.

Vancouver:

Moussallam M. Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes. [Internet] [Doctoral dissertation]. Paris, ENST; 2012. [cited 2019 Oct 23]. Available from: http://www.theses.fr/2012ENST0079.

Council of Science Editors:

Moussallam M. Représentations redondantes et hiérarchiques pour l'archivage et la compression de scènes sonores : Sparse and herarchical representations for archival and compression of audio scenes. [Doctoral Dissertation]. Paris, ENST; 2012. Available from: http://www.theses.fr/2012ENST0079


NSYSU

16. Chiou, Hai-Tang. Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection.

Degree: PhD, Applied Mathematics, 2017, NSYSU

 Linear regression is a well-known method to establish relationship between responses and explanatory variables, and has been used extensively in practical applications. This dissertation consists… (more)

Subjects/Keywords: modified Cholesky decomposition; long-memory processes; heteroscedasticity; location-dispersion model; orthogonal greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiou, H. (2017). Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-113628

Chicago Manual of Style (16th Edition):

Chiou, Hai-Tang. “Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection.” 2017. Doctoral Dissertation, NSYSU. Accessed October 23, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-113628.

MLA Handbook (7th Edition):

Chiou, Hai-Tang. “Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection.” 2017. Web. 23 Oct 2019.

Vancouver:

Chiou H. Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection. [Internet] [Doctoral dissertation]. NSYSU; 2017. [cited 2019 Oct 23]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-113628.

Council of Science Editors:

Chiou H. Inference for regression models with time series errors â Inverse autocovariance matrix estimation and high dimensional model selection. [Doctoral Dissertation]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617117-113628


Virginia Tech

17. Sun, Qing. Greedy Inference Algorithms for Structured and Neural Models.

Degree: PhD, Electrical Engineering, 2018, Virginia Tech

 A number of problems in Computer Vision, Natural Language Processing, and Machine Learning produce structured outputs in high-dimensional space, which makes searching for the global… (more)

Subjects/Keywords: greedy algorithm; natural language processing; graph models; recurrent neural networks; beam search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, Q. (2018). Greedy Inference Algorithms for Structured and Neural Models. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/81860

Chicago Manual of Style (16th Edition):

Sun, Qing. “Greedy Inference Algorithms for Structured and Neural Models.” 2018. Doctoral Dissertation, Virginia Tech. Accessed October 23, 2019. http://hdl.handle.net/10919/81860.

MLA Handbook (7th Edition):

Sun, Qing. “Greedy Inference Algorithms for Structured and Neural Models.” 2018. Web. 23 Oct 2019.

Vancouver:

Sun Q. Greedy Inference Algorithms for Structured and Neural Models. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/10919/81860.

Council of Science Editors:

Sun Q. Greedy Inference Algorithms for Structured and Neural Models. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/81860

18. Farooq, Farhan. Optimal Path Searching through Specified Routes using different Algorithms.

Degree: Computer Engineering, 2009, Dalarna University

  To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the… (more)

Subjects/Keywords: Routing problem; Shortest Path; Greedy Algorithm; Simulated Annealing; Exhaustive Search; Travelling Salesman Problem; Combinatorial Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farooq, F. (2009). Optimal Path Searching through Specified Routes using different Algorithms. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530

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

Chicago Manual of Style (16th Edition):

Farooq, Farhan. “Optimal Path Searching through Specified Routes using different Algorithms.” 2009. Thesis, Dalarna University. Accessed October 23, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

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

MLA Handbook (7th Edition):

Farooq, Farhan. “Optimal Path Searching through Specified Routes using different Algorithms.” 2009. Web. 23 Oct 2019.

Vancouver:

Farooq F. Optimal Path Searching through Specified Routes using different Algorithms. [Internet] [Thesis]. Dalarna University; 2009. [cited 2019 Oct 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

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

Council of Science Editors:

Farooq F. Optimal Path Searching through Specified Routes using different Algorithms. [Thesis]. Dalarna University; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530

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


University of Ottawa

19. Jacob-David, Dany D. Effective Resource Allocation for Non-cooperative Spectrum Sharing .

Degree: 2011, University of Ottawa

 Spectrum access protocols have been proposed recently to provide flexible and efficient use of the available bandwidth. Game theory has been applied to the analysis… (more)

Subjects/Keywords: Resource allocation; Spectrum sharing; non-cooperative game; iterative water-filling; greedy algorithm; spectrum management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jacob-David, D. D. (2011). Effective Resource Allocation for Non-cooperative Spectrum Sharing . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/20316

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

Chicago Manual of Style (16th Edition):

Jacob-David, Dany D. “Effective Resource Allocation for Non-cooperative Spectrum Sharing .” 2011. Thesis, University of Ottawa. Accessed October 23, 2019. http://hdl.handle.net/10393/20316.

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

MLA Handbook (7th Edition):

Jacob-David, Dany D. “Effective Resource Allocation for Non-cooperative Spectrum Sharing .” 2011. Web. 23 Oct 2019.

Vancouver:

Jacob-David DD. Effective Resource Allocation for Non-cooperative Spectrum Sharing . [Internet] [Thesis]. University of Ottawa; 2011. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/10393/20316.

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

Council of Science Editors:

Jacob-David DD. Effective Resource Allocation for Non-cooperative Spectrum Sharing . [Thesis]. University of Ottawa; 2011. Available from: http://hdl.handle.net/10393/20316

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


University of Tennessee – Knoxville

20. Zhang, Yang. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.

Degree: MS, Computer Engineering, 2016, University of Tennessee – Knoxville

  Taxi ride sharing is one of the most promising solutions to urban transportation issues, such as traffic congestion, gas insufficiency, air pollution, limited parking… (more)

Subjects/Keywords: ride sharing; greedy algorithm; vehicle routing problem; mixed integer programming; Other Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2016). Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/4275

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

Chicago Manual of Style (16th Edition):

Zhang, Yang. “Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.” 2016. Thesis, University of Tennessee – Knoxville. Accessed October 23, 2019. https://trace.tennessee.edu/utk_gradthes/4275.

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

MLA Handbook (7th Edition):

Zhang, Yang. “Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.” 2016. Web. 23 Oct 2019.

Vancouver:

Zhang Y. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. [Internet] [Thesis]. University of Tennessee – Knoxville; 2016. [cited 2019 Oct 23]. Available from: https://trace.tennessee.edu/utk_gradthes/4275.

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

Council of Science Editors:

Zhang Y. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. [Thesis]. University of Tennessee – Knoxville; 2016. Available from: https://trace.tennessee.edu/utk_gradthes/4275

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


University of Windsor

21. PATEL, PARTH ATULKUMAR. Productive Cluster Hire.

Degree: M.C.Sc., Computer Science, 2019, University of Windsor

 Discovering a group of experts to complete a set of tasks that require various skills is known as Cluster Hire Problem. Each expert has a… (more)

Subjects/Keywords: Bi-objective maximization; Cluster Hire; Data Mining; Greedy Algorithm; Productivity; Team Formation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PATEL, P. A. (2019). Productive Cluster Hire. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7652

Chicago Manual of Style (16th Edition):

PATEL, PARTH ATULKUMAR. “Productive Cluster Hire.” 2019. Masters Thesis, University of Windsor. Accessed October 23, 2019. https://scholar.uwindsor.ca/etd/7652.

MLA Handbook (7th Edition):

PATEL, PARTH ATULKUMAR. “Productive Cluster Hire.” 2019. Web. 23 Oct 2019.

Vancouver:

PATEL PA. Productive Cluster Hire. [Internet] [Masters thesis]. University of Windsor; 2019. [cited 2019 Oct 23]. Available from: https://scholar.uwindsor.ca/etd/7652.

Council of Science Editors:

PATEL PA. Productive Cluster Hire. [Masters Thesis]. University of Windsor; 2019. Available from: https://scholar.uwindsor.ca/etd/7652


Northeastern University

22. Terragnoli, John P. Stripmap SAR pulse interleaved scheduling.

Degree: MS, Department of Electrical and Computer Engineering, 2018, Northeastern University

 Stripmap SAR is a radar mode used to image terrain from an airborne platform; it does so by transmitting and receiving a series of electromagnetic… (more)

Subjects/Keywords: greedy algorithm; local search; pulse interleaving; scheduling; stripmap SAR; synthetic aperture radar

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Terragnoli, J. P. (2018). Stripmap SAR pulse interleaved scheduling. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20292521

Chicago Manual of Style (16th Edition):

Terragnoli, John P. “Stripmap SAR pulse interleaved scheduling.” 2018. Masters Thesis, Northeastern University. Accessed October 23, 2019. http://hdl.handle.net/2047/D20292521.

MLA Handbook (7th Edition):

Terragnoli, John P. “Stripmap SAR pulse interleaved scheduling.” 2018. Web. 23 Oct 2019.

Vancouver:

Terragnoli JP. Stripmap SAR pulse interleaved scheduling. [Internet] [Masters thesis]. Northeastern University; 2018. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/2047/D20292521.

Council of Science Editors:

Terragnoli JP. Stripmap SAR pulse interleaved scheduling. [Masters Thesis]. Northeastern University; 2018. Available from: http://hdl.handle.net/2047/D20292521


University of Guelph

23. Wong, Chi Him. Novel universal cycle constructions for a variety of combinatorial objects .

Degree: 2015, University of Guelph

 The cyclic sequence 0000100110101111 has the unlikely property that the 16 unique binary substrings of length 4 appear exactly once in the sequence as a… (more)

Subjects/Keywords: universal cycle; de Bruijn sequence; combinatorics on words; FKM algorithm; shift rule; necklace prefix algorithm; Gray code; CAT algorithm; Greedy algorithm; successor rule; nonlinear feedback shift register

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, C. H. (2015). Novel universal cycle constructions for a variety of combinatorial objects . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8812

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

Chicago Manual of Style (16th Edition):

Wong, Chi Him. “Novel universal cycle constructions for a variety of combinatorial objects .” 2015. Thesis, University of Guelph. Accessed October 23, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8812.

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

MLA Handbook (7th Edition):

Wong, Chi Him. “Novel universal cycle constructions for a variety of combinatorial objects .” 2015. Web. 23 Oct 2019.

Vancouver:

Wong CH. Novel universal cycle constructions for a variety of combinatorial objects . [Internet] [Thesis]. University of Guelph; 2015. [cited 2019 Oct 23]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8812.

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

Council of Science Editors:

Wong CH. Novel universal cycle constructions for a variety of combinatorial objects . [Thesis]. University of Guelph; 2015. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8812

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

24. 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)

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 23, 2019. http://www.theses.fr/2013TOUR3311.

MLA Handbook (7th 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. 23 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 23]. 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

25. 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 23, 2019. http://www.theses.fr/2014TOUR4008.

MLA Handbook (7th Edition):

Ahmed, Fareed. “Un nouvel a priori de formes pour les contours actifs : A new shape prior for active contour model.” 2014. Web. 23 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 23]. 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

26. Combier, Camille. Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps.

Degree: Docteur es, Informatique, 2012, Université Claude Bernard – Lyon I

Une carte généralisée est un modèle topologique permettant de représenter implicitementun ensemble de cellules (sommets, arêtes, faces , volumes, . . .) ainsi que l’ensemblede… (more)

Subjects/Keywords: Carte généralisée; Maillage; Mesure de similarité; Ensembles d'heuristiques; Algorithme glouton; Genralized map; Mesh; Similarity measure; Set of heuristics; Greedy algorithm; 006.693

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Combier, C. (2012). Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2012LYO10272

Chicago Manual of Style (16th Edition):

Combier, Camille. “Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps.” 2012. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed October 23, 2019. http://www.theses.fr/2012LYO10272.

MLA Handbook (7th Edition):

Combier, Camille. “Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps.” 2012. Web. 23 Oct 2019.

Vancouver:

Combier C. Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2012. [cited 2019 Oct 23]. Available from: http://www.theses.fr/2012LYO10272.

Council of Science Editors:

Combier C. Mesures de similarité pour cartes généralisées : Similarity measures between generalized maps. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2012. Available from: http://www.theses.fr/2012LYO10272


NSYSU

27. Ho, Ping-Hsien. An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks.

Degree: Master, Electrical Engineering, 2012, NSYSU

 In an IEEE802.15.4 beacon-enabled wireless personal area network (WPAN), the PAN coordinator can allocate slots using contention free-GTSs (guaranteed the time slots) for admitted devices.… (more)

Subjects/Keywords: greedy algorithm; IEEE 802.15.4; GTSs (guaranteed the time slots); bandwidth waste; wireless personal area networks (WPANs); multi-beacon superframe structure (MBS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ho, P. (2012). An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0613112-110745

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

Chicago Manual of Style (16th Edition):

Ho, Ping-Hsien. “An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks.” 2012. Thesis, NSYSU. Accessed October 23, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0613112-110745.

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

MLA Handbook (7th Edition):

Ho, Ping-Hsien. “An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks.” 2012. Web. 23 Oct 2019.

Vancouver:

Ho P. An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 23]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0613112-110745.

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

Council of Science Editors:

Ho P. An Enhanced Multi-Beacon Superframe Structure for IEEE 802.15.4 Wireless Personal Area Networks. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0613112-110745

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


Université de Montréal

28. Monty, Pierre Paul. Traduction statistique par recherche locale .

Degree: 2010, Université de Montréal

 La traduction statistique vise l’automatisation de la traduction par le biais de modèles statistiques. Dans ce travail, nous relevons un des grands défis du domaine… (more)

Subjects/Keywords: Traduction statistique; Statistical translation; Modèle à base de segments; Phrase based model; Recherche locale; Local search; Algorithme glouton; Greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monty, P. P. (2010). Traduction statistique par recherche locale . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/4515

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

Chicago Manual of Style (16th Edition):

Monty, Pierre Paul. “Traduction statistique par recherche locale .” 2010. Thesis, Université de Montréal. Accessed October 23, 2019. http://hdl.handle.net/1866/4515.

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

MLA Handbook (7th Edition):

Monty, Pierre Paul. “Traduction statistique par recherche locale .” 2010. Web. 23 Oct 2019.

Vancouver:

Monty PP. Traduction statistique par recherche locale . [Internet] [Thesis]. Université de Montréal; 2010. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1866/4515.

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

Council of Science Editors:

Monty PP. Traduction statistique par recherche locale . [Thesis]. Université de Montréal; 2010. Available from: http://hdl.handle.net/1866/4515

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


Michigan Technological University

29. McCorkle, Colin G. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.

Degree: MS, Department of Civil and Environmental Engineering, 2014, Michigan Technological University

  More than eighteen percent of the world’s population lives without reliable access to clean water, forced to walk long distances to get small amounts… (more)

Subjects/Keywords: clean water; water distribution system; Boajibu; Sierra Leone; Adaptive Greedy Heuristic Loop Addition Selection Algorithm (AGHLASA); Environmental Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McCorkle, C. G. (2014). TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. (Masters Thesis). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etds/831

Chicago Manual of Style (16th Edition):

McCorkle, Colin G. “TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.” 2014. Masters Thesis, Michigan Technological University. Accessed October 23, 2019. http://digitalcommons.mtu.edu/etds/831.

MLA Handbook (7th Edition):

McCorkle, Colin G. “TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.” 2014. Web. 23 Oct 2019.

Vancouver:

McCorkle CG. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. [Internet] [Masters thesis]. Michigan Technological University; 2014. [cited 2019 Oct 23]. Available from: http://digitalcommons.mtu.edu/etds/831.

Council of Science Editors:

McCorkle CG. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. [Masters Thesis]. Michigan Technological University; 2014. Available from: http://digitalcommons.mtu.edu/etds/831


University of Southern California

30. Comboul, Maud. Stochastic and multiscale models for urban and natural ecology.

Degree: PhD, Civil Engineering (Environmental Engineering), 2012, University of Southern California

 This research reflects on both particular cases of ecologies: sensor networks in urban water distribution systems and forest dynamics under changing disturbance regime, and the… (more)

Subjects/Keywords: stochastic optimization; greedy algorithm; sensor network; Monte Carlo simulations agent-based model; Markov dynamics; multiscale dynamics; forest dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comboul, M. (2012). Stochastic and multiscale models for urban and natural ecology. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/72481/rec/6062

Chicago Manual of Style (16th Edition):

Comboul, Maud. “Stochastic and multiscale models for urban and natural ecology.” 2012. Doctoral Dissertation, University of Southern California. Accessed October 23, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/72481/rec/6062.

MLA Handbook (7th Edition):

Comboul, Maud. “Stochastic and multiscale models for urban and natural ecology.” 2012. Web. 23 Oct 2019.

Vancouver:

Comboul M. Stochastic and multiscale models for urban and natural ecology. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2019 Oct 23]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/72481/rec/6062.

Council of Science Editors:

Comboul M. Stochastic and multiscale models for urban and natural ecology. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/72481/rec/6062

[1] [2] [3]

.