Relevant bibliographies by topics / Greedy Algorithms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Greedy Algorithms.

Dissertations / Theses on the topic 'Greedy Algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Greedy Algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Sundman, Dennis. "Greedy Algorithms for Distributed Compressed Sensing." Doctoral thesis, KTH, Kommunikationsteori, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-144907.

Full text
Abstract:
Compressed sensing (CS) is a recently invented sub-sampling technique that utilizes sparsity in full signals. Most natural signals possess this sparsity property. From a sub-sampled vector, some CS reconstruction algorithm is used to recover the full signal. One class of reconstruction algorithms is formed by the greedy pursuit, or simply greedy, algorithms, which is popular due to low complexity and good performance. Meanwhile, in sensor networks, sensor nodes monitor natural data for estimation or detection. One application of sensor networking is in cognitive radio networks, where sensor no
APA, Harvard, Vancouver, ISO, and other styles
2

Beis, Michail. "Greedy algorithms for random regular graphs." Thesis, University of Liverpool, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Determe, Jean-François. "Greedy algorithms for multi-channel sparse recovery." Doctoral thesis, Universite Libre de Bruxelles, 2018. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/265808.

Full text
Abstract:
During the last decade, research has shown compressive sensing (CS) to be a promising theoretical framework for reconstructing high-dimensional sparse signals. Leveraging a sparsity hypothesis, algorithms based on CS reconstruct signals on the basis of a limited set of (often random) measurements. Such algorithms require fewer measurements than conventional techniques to fully reconstruct a sparse signal, thereby saving time and hardware resources. This thesis addresses several challenges. The first is to theoretically understand how some parameters—such as noise variance—affect the performanc
APA, Harvard, Vancouver, ISO, and other styles
4

Puricella, Antonio. "The complexity of greedy algorithms on ordered graphs." Thesis, University of Leicester, 2002. http://hdl.handle.net/2381/30518.

Full text
Abstract:
Let p be any fixed polynomial time testable, non-trivial, hereditary property of graphs. Suppose that the vertices of a graph G are not necessarily linearly ordered but partially ordered, where we think of this partial order as a collection of (possibly exponentially many) linear orders in the natural way. In the first part of this thesis, we prove that the problem of deciding whether a lexicographically first maximal (with respect to one of these linear orders) subgraph of G satisfying p, contains a specified vertex is NP-complete. For some of these properties p we then show that by applying
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Qing. "Greedy Inference Algorithms for Structured and Neural Models." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/81860.

Full text
Abstract:
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 optimal solution extremely expensive. Thus, greedy algorithms, making trade-offs between precision and efficiency, are widely used. %Unfortunately, they in general lack theoretical guarantees. In this thesis, we prove that greedy algorithms are effective and efficient to search for multiple top-scoring hypotheses from structured (neural) models: 1) Entropy estimation. We aim to find deterministic samples that are
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
In this thesis, I survey 11 approximation algorithms for unweighted set cover problem. I have also implemented the three algorithms and created a software library that stores the code I have written. The algorithms I survey are: 1. Johnson's standard greedy; 2. f-frequency greedy; 3. Goldsmidt, Hochbaum and Yu's modified greedy; 4. Halldorsson's local optimization; 5. Dur and Furer semi local optimization; 6. Asaf Levin's improvement to Dur and Furer; 7. Simple rounding; 8. Randomized rounding; 9. LP duality; 10. Primal-dual schema; and 11. Network flow technique. Most of the algorithms surve
APA, Harvard, Vancouver, ISO, and other styles
7

Oglic, Dino [Verfasser]. "Constructive Approximation and Learning by Greedy Algorithms / Dino Oglic." Bonn : Universitäts- und Landesbibliothek Bonn, 2018. http://d-nb.info/1170777910/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yuen, Chi-kan. "A double-track greedy algorithm for VLSI channel routing /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19656373.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Razanajatovo, Misanantenaina Valisoa. "Properties of greedy trees." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/95909.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: A greedy tree is constructed from a given degree sequence using a simple greedy algorithm that assigns the highest degree to the root, the second, the third, . . . , -highest degree to the root’s neighbours, etc. This particular tree is the solution to numerous extremal problems among all trees with given degree sequence. In this thesis, we collect results for some distancebased graph invariants, the number of subtrees and the spectral radius in which greedy trees play a major role. We show that greedy trees are extremal
APA, Harvard, Vancouver, ISO, and other styles
10

Ortiz, John E. "Absolute position measurement for automated guided vehicles using the Greedy DeBruijn Sequence." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Sep%5FOrtiz.pdf.

Full text
Abstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 2006.<br>Thesis Advisor(s): Harold M. Fredricksen, Jon T. Butler. "September 2006." Includes bibliographical references (p. 149). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
11

Almulla, Mohammed Ali. "A class of greedy algorithms for solving the travelling salesman problem /." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59557.

Full text
Abstract:
The travelling salesman problem is one of the NP-complete problems. It has been under consideration in computer science for at least forty years. Solving this hard problem using search methods can be accomplished by choosing: a starting point, a solution generation scheme and a termination rule. When the termination rule is such that search stops if and only if the tour is optimal, we call the method "exact". When the termination rule is such that the search stops but not necessarily with an optimal tour, we call the method "approximate".<br>This thesis looks closely at one of the approximate
APA, Harvard, Vancouver, ISO, and other styles
12

袁志勤 and Chi-kan Yuen. "A double-track greedy algorithm for VLSI channel routing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31220241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Harper, Gavin. "The selection of compounds for screening in pharmaceutical research." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Ghebreamlak, Kidane Asrat. "Analysis of Algorithms for Combinatorial Auctions and Related Problems." Doctoral thesis, Uppsala : Department of Mathematics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Li, Shimin. "Geometric Algorithms for Intervals and Related Problems." DigitalCommons@USU, 2018. https://digitalcommons.usu.edu/etd/7035.

Full text
Abstract:
In this dissertation, we study several problems related to intervals and develop efficient algorithms for them. Interval problems have many applications in reality because many objects, values, and ranges are intervals in nature, such as time intervals, distances, line segments, probabilities, etc. Problems on intervals are gaining attention also because intervals are among the most basic geometric objects, and for the same reason, computational geometry techniques find useful for attacking these problems. Specifically, the problems we study in this dissertation includes the following: balance
APA, Harvard, Vancouver, ISO, and other styles
16

TAKADA, Hiroaki, Hiroyuki TOMIYAMA, Gang ZENG, and Tetsuo YOKOYAMA. "Static Task Scheduling Algorithms Based on Greedy Heuristics for Battery-Powered DVS Systems." Institute of Electronics, Information and Communication Engineers, 2010. http://hdl.handle.net/2237/15037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Jones, Jeffrey S. "Analysis of Algorithms for Star Bicoloring and Related Problems." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1426770501.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Sundman, Dennis. "Compressed Sensing : Algorithms and Applications." Licentiate thesis, KTH, Kommunikationsteori, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-90074.

Full text
Abstract:
The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. Ina general cs setup, few measurement coefficients are available and thetask is to reconstruct a larger, sparse signal.In this thesis we focus on algorithm design and selected applicationsfor cs. The contributions of the thesis appear in the followin
APA, Harvard, Vancouver, ISO, and other styles
19

Mor, Stefano Drimon Kurz. "Analysis of synchronizations in greedy-scheduled executions and applications to efficient generation of pseudorandom numbers in parallel." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/130529.

Full text
Abstract:
Nous présentons deux contributions dans le domaine de la programmation parallèle. La première est théorique : nous introduisons l’analyse SIPS, une approche nouvelle pour dénombrer le nombre d’opérations de synchronisation durant l’exécution d’un algorithme parallèle ordonnancé par vol de travail. Basée sur le concept d’horloges logiques, elle nous permet : d’une part de donner de nouvelles majorations de coût en moyenne; d’autre part de concevoir des programmes parallèles plus efficaces par adaptation dynamique de la granularité. La seconde contribution est pragmatique : nous présentons une p
APA, Harvard, Vancouver, ISO, and other styles
20

Farooq, Farhan. "Optimal Path Searching through Specified Routes using different Algorithms." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

Full text
Abstract:
To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive sea
APA, Harvard, Vancouver, ISO, and other styles
21

Venmani, Daniel Philip. "Multi-operator greedy routing based on open routers." Phd thesis, Institut National des Télécommunications, 2014. http://tel.archives-ouvertes.fr/tel-00997721.

Full text
Abstract:
Revolutionary mobile technologies, such as high-speed packet access 3G (HSPA+) and LTE, have significantly increased mobile data rate over the radio link. While most of the world looks at this revolution as a blessing to their day-to-day life, a little-known fact is that these improvements over the radio access link results in demanding tremendous improvements in bandwidth on the backhaul network. Having said this, today's Internet Service Providers (ISPs) and Mobile Network Operators (MNOs) are intemperately impacted as a result of this excessive smartphone usage. The operational costs (OPEX)
APA, Harvard, Vancouver, ISO, and other styles
22

Li, Hui. "Algorithms for the selection of optimal spaced seed sets for transposable element identification." Miami University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=miami1283178156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Kontak, Max [Verfasser]. "Novel algorithms of greedy-type for probability density estimation as well as linear and nonlinear inverse problems / Max Kontak." Siegen : Universitätsbibliothek der Universität Siegen, 2018. http://d-nb.info/1157094554/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. https://etd.iisc.ac.in/handle/2005/196.

Full text
Abstract:
In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of cons
APA, Harvard, Vancouver, ISO, and other styles
25

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. http://hdl.handle.net/2005/196.

Full text
Abstract:
In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of consid
APA, Harvard, Vancouver, ISO, and other styles
26

Altman, James Ross. "A Practical Comprehensive Approach to PMU Placement for Full Observability." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/31200.

Full text
Abstract:
In recent years, the placement of phasor measurement units (PMUs) in electric transmission systems has gained much attention. Engineers and mathematicians have developed a variety of algorithms to determine the best locations for PMU installation. But often these placement algorithms are not practical for real systems and do not cover the whole process. This thesis presents a strategy that is practical and addresses three important topics: system preparation, placement algorithm, and installation scheduling. To be practical, a PMU strategy should strive for full observability, work well wi
APA, Harvard, Vancouver, ISO, and other styles
27

Venmani, Daniel Philip. "Multi-operator greedy routing based on open routers." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0003.

Full text
Abstract:
Les évolutions technologies mobiles majeures, tels que les réseaux mobiles 3G, HSPA+ et LTE, ont augmenté de façon significative la capacité des données véhiculées sur liaison radio. Alors que les avantages de ces évolutions sont évidents à l’usage, un fait moins connu est que ces améliorations portant principalement sur l’accès radio nécessitent aussi des avancées technologiques dans le réseau de collecte (backhaul) pour supporter cette augmentation de bande passante. Les fournisseurs d’accès Internet (FAI) et les opérateurs de réseau mobile doivent relever un réel défi pour accompagner l’usa
APA, Harvard, Vancouver, ISO, and other styles
28

Mahadevan, Muralidharan Ananth. "Analysis of Garbage Collector Algorithms in Non-Volatile Memory Devices." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1365811711.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Balasubramaniam, Thirunavukarasu. "Matrix/tensor factorization with selective coordinate descent: Algorithms and output usage." Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/203189/1/Thirunavukarasu_Balasubramaniam_Thesis.pdf.

Full text
Abstract:
With advanced data collection methods and the tremendous growth in the number of online users, multi-context data has become ubiquitous and its analysis for knowledge discovery has become inevitable. Matrix/tensor factorizations are commonly used knowledge discovery methods. This thesis developed selective Coordinate Descent (SCD) algorithms that select only a few important elements during the factorization process to minimize the computational complexity and to improve the efficiency of factorization. Moreover, this thesis exploits various ways the output of SCD factorization can be applied i
APA, Harvard, Vancouver, ISO, and other styles
30

He, Jeannie. "Automatic Diagnosis of Parkinson’s Disease Using Machine Learning : A Comparative Study of Different Feature Selection Algorithms, Classifiers and Sampling Methods." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301616.

Full text
Abstract:
Over the past few years, several studies have been published to propose algorithms for the automated diagnosis of Parkinson’s Disease using simple exams such as drawing and voice exams. However, at the same time as all classifiers appear to have been outperformed by another classifier in at least one study, there appear to lack a study on how well different classifiers work with a certain feature selection algorithm and sampling method. More importantly, there appear to lack a study that compares the proposed feature selection algorithm and/or sampling method with a baseline that does not invo
APA, Harvard, Vancouver, ISO, and other styles
31

Berger, Karl-Eduard. "Placement de graphes de tâches de grande taille sur architectures massivement multicoeurs." Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLV026/document.

Full text
Abstract:
Ce travail de thèse de doctorat est dédié à l'étude d'un problème de placement de tâches dans le domaine de la compilation d'applications pour des architectures massivement parallèles. Ce problème vient en réponse à certains besoins industriels tels que l'économie d'énergie, la demande de performances pour les applications de type flots de données synchrones. Ce problème de placement doit être résolu dans le respect de trois critères: les algorithmes doivent être capable de traiter des applications de tailles variables, ils doivent répondre aux contraintes de capacités des processeurs et prend
APA, Harvard, Vancouver, ISO, and other styles
32

Nguyen, Minh-Lien Jeanne. "Estimation non paramétrique de densités conditionnelles : grande dimension, parcimonie et algorithmes gloutons." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS185/document.

Full text
Abstract:
Nous considérons le problème d’estimation de densités conditionnelles en modérément grandes dimensions. Beaucoup plus informatives que les fonctions de régression, les densités condi- tionnelles sont d’un intérêt majeur dans les méthodes récentes, notamment dans le cadre bayésien (étude de la distribution postérieure, recherche de ses modes...). Après avoir rappelé les problèmes liés à l’estimation en grande dimension dans l’introduction, les deux chapitres suivants développent deux méthodes qui s’attaquent au fléau de la dimension en demandant : d’être efficace computat
APA, Harvard, Vancouver, ISO, and other styles
33

Turlapaty, Sandhya. "Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting." UNF Digital Commons, 2018. https://digitalcommons.unf.edu/etd/816.

Full text
Abstract:
An implementation framework has been developed in this thesis for a well-known APX-hard combinatorial optimization problem known as Block Sorting. The motivation for the study of this problem comes from applications such as computational biology and optical character recognition. While existing Block Sorting research has been theoretically focused on the development and analysis of several approximation algorithms for Block Sorting, little or no work has been carried out thus far on the implementation of the proposed approximation algorithms. The conceptualization of an implementation framewor
APA, Harvard, Vancouver, ISO, and other styles
34

Renaud-Goud, Paul. "Energy-aware scheduling : complexity and algorithms." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00744247.

Full text
Abstract:
In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third c
APA, Harvard, Vancouver, ISO, and other styles
35

Muñoz, Jugo Cynthia Mariela. "Algoritmos Greedy." Universidad Peruana de Ciencias Aplicadas - UPC, 2007. http://hdl.handle.net/10757/272784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Nguyen, Thi Thanh. "Algorithmes gloutons orthogonaux sous contrainte de positivité." Thesis, Université de Lorraine, 2019. http://www.theses.fr/2019LORR0133/document.

Full text
Abstract:
De nombreux domaines applicatifs conduisent à résoudre des problèmes inverses où le signal ou l'image à reconstruire est à la fois parcimonieux et positif. Si la structure de certains algorithmes de reconstruction parcimonieuse s'adapte directement pour traiter les contraintes de positivité, il n'en va pas de même des algorithmes gloutons orthogonaux comme OMP et OLS. Leur extension positive pose des problèmes d'implémentation car les sous-problèmes de moindres carrés positifs à résoudre ne possèdent pas de solution explicite. Dans la littérature, les algorithmes gloutons positifs (NNOG, pour
APA, Harvard, Vancouver, ISO, and other styles
37

Kadri, Ahmed Abdelmoumene. "Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0268.

Full text
Abstract:
Les enjeux du développement durable, le réchauffement climatique, la pollution dans les grandes villes, la congestion et les nuisances sonores, l'augmentation des prix de carburants, sont parmi des nombreux facteurs qui incitent les pays développés à l'innovation dans les transports publics. Dans ce contexte, l'introduction des systèmes de vélos en libre-service, au cours de ces dernières années, est une des solutions adoptées par de nombreuses grandes villes. Malgré leur succès fulgurant dans le monde entier, il existe peu d'études fondamentales sur ce type transport urbain. Pourtant, leur ex
APA, Harvard, Vancouver, ISO, and other styles
38

Kadri, Ahmed Abdelmoumene. "Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems." Electronic Thesis or Diss., Université de Lorraine, 2015. http://www.theses.fr/2015LORR0268.

Full text
Abstract:
Les enjeux du développement durable, le réchauffement climatique, la pollution dans les grandes villes, la congestion et les nuisances sonores, l'augmentation des prix de carburants, sont parmi des nombreux facteurs qui incitent les pays développés à l'innovation dans les transports publics. Dans ce contexte, l'introduction des systèmes de vélos en libre-service, au cours de ces dernières années, est une des solutions adoptées par de nombreuses grandes villes. Malgré leur succès fulgurant dans le monde entier, il existe peu d'études fondamentales sur ce type transport urbain. Pourtant, leur ex
APA, Harvard, Vancouver, ISO, and other styles
39

Balakrishnan, Ramasamy. "A greedy algorithm based router." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq37475.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Nguyen, Thi Thanh. "Algorithmes gloutons orthogonaux sous contrainte de positivité." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0133.

Full text
Abstract:
De nombreux domaines applicatifs conduisent à résoudre des problèmes inverses où le signal ou l'image à reconstruire est à la fois parcimonieux et positif. Si la structure de certains algorithmes de reconstruction parcimonieuse s'adapte directement pour traiter les contraintes de positivité, il n'en va pas de même des algorithmes gloutons orthogonaux comme OMP et OLS. Leur extension positive pose des problèmes d'implémentation car les sous-problèmes de moindres carrés positifs à résoudre ne possèdent pas de solution explicite. Dans la littérature, les algorithmes gloutons positifs (NNOG, pour
APA, Harvard, Vancouver, ISO, and other styles
41

Jurčík, Lukáš. "Evoluční algoritmy při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224447.

Full text
Abstract:
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.
APA, Harvard, Vancouver, ISO, and other styles
42

Dore, Lucia. "Matroidi e Algoritmo Greedy." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20798/.

Full text
Abstract:
Il primo capitolo di questa trattazione presenta nove differenti definizioni assiomatiche di matroide, che si dimostrano essere equivalenti attraverso il concetto di criptomorfismo. Nel secondo capitolo andremo a studiare le matroidi grafiche come esempio di matroidi. Col termine ‘matroide grafica’ indichiamo la struttura assunta da un grafo che si verifica soddisfare i vari sistemi assiomatici introdotti nel capitolo precedente. Un’attenzione particolare è data al Polinomio di Tutte, nato come oggetto definito per i grafi ed esteso successivamente alle matroidi. L’ultimo capitolo vede invece
APA, Harvard, Vancouver, ISO, and other styles
43

Zainiev, Timur. "Quantum mechanics and the greedy algorithm." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Full text
Abstract:
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
APA, Harvard, Vancouver, ISO, and other styles
45

Naeimi, Helia DeHon André. "A greedy algorithm for tolerating defective crosspoints in nanoPLA design /." Diss., Pasadena, Calif. : California Institute of Technology, 2005. http://resolver.caltech.edu/CaltechETD:etd-05052005-164226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Zakaria, Rabih. "Optimization of the car relocation operations in one-way carsharing systems." Thesis, Belfort-Montbéliard, 2015. http://www.theses.fr/2015BELF0281/document.

Full text
Abstract:
L'autopartage est un service de mobilité qui offre les mêmes avantages que les voitures particulières mais sansnotion de propriété. Les clients du système peuvent accéder aux véhicules sans ou avec réservation préalable. Laflotte de voitures est distribuée entre les stations et les clients peuvent prendre une voiture d'une station et ladéposer dans n'importe quelle autre station (one-way), chaque station disposant d'un nombre maximum de placesde stationnement. La demande pour la prise ou le retour des voitures dans chaque station est souvent asymétriqueentre les stations et varie au cours de l
APA, Harvard, Vancouver, ISO, and other styles
47

Burrowbridge, Sarah Elizabeth. "Optimal Allocation of Satellite Network Resources." Thesis, Virginia Tech, 1999. http://hdl.handle.net/10919/36385.

Full text
Abstract:
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 of the general scheduling problem. Making some basic simplifications, such as the limitation of the mission scenarios to Low Earth Orbiting satellites, allows the effective application of the rigorous methods of the Greedy Activity-Selector algorithm. Tools such as Analytical Graphic's Satellite Tool Kit and MATLAB 5.0 are integrated to assist in the implementation of the algorithm. Several examples are presented in order to ill
APA, Harvard, Vancouver, ISO, and other styles
48

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." Thesis, Amiens, 2015. http://www.theses.fr/2015AMIE0009/document.

Full text
Abstract:
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 part la problématique générale du réseau de transport avec une variante portant plus précisément sur la planification des tournées avec une équipe de véhicules, d’autre part le problème de gestion de sessions en mode multicast dans un réseau de télécommunication, abordé ici du point de vue plus général du partitionnement dans un graphe biparti. Ces deux applications sont évidemment d’intérêt, tant
APA, Harvard, Vancouver, ISO, and other styles
49

Althoby, Haeder Younis Ghawi. "Theoritical and numerical studies on the graph partitioning problem." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMC233/document.

Full text
Abstract:
Étant donné G = (V, E) un graphe non orienté connexe et un entier positif β (n), où n est le nombrede sommets de G, le problème du séparateur (VSP) consiste à trouver une partition de V en troisclasses A, B et C de sorte qu'il n'y a pas d'arêtes entre A et B, max {| A |, | B |} est inférieur ou égal àβ (n) et | C | est minimum. Dans cette thèse, nous considérons une modélisation du problème sous laforme d'un programme linéaire en nombres entiers. Nous décrivons certaines inégalités valides et etdéveloppons des algorithmes basés sur un schéma de voisinage.Nous étudions également le problème du
APA, Harvard, Vancouver, ISO, and other styles
50

Neas, Charles Bennett. "A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/36213.

Full text
Abstract:
This thesis presents a greedy search algorithm for maneuver-based motion planning of agile vehicles. In maneuver-based motion planning, vehicle maneuvers are solved offline and saved in a library to be used during motion planning. From this library, a tree of possible vehicle states can be generated through the search space. A depth-first, library-based algorithm called AD-Lib is developed and used to quickly provide feasible trajectories along the tree. AD-Lib combines greedy search techniques with hill climbing and effective backtracking to guide the search process rapidly towards the go
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Greedy Algorithms' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography