Conecte-se

Bibliografias temáticas / Algorithm / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Algorithm.

Teses / dissertações sobre o tema "Algorithm"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 25 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Algorithm".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

Yarmolskyy, Oleksandr. "Využití distribuovaných a stochastických algoritmů v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Texto completo da fonte

Resumo:

This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Harris, Steven C. "A genetic algorithm for robust simulation optimization." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178645751.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Gauthier, Morgan. "Déploiement haut niveau d'applications automobiles sur les architectures E/E futures." Electronic Thesis or Diss., Toulouse, ISAE, 2024. http://www.theses.fr/2024ESAE0037.

Texto completo da fonte

Resumo:

Cette thèse aborde les défis liés à la conception des futures architectures électriques/électroniques automobiles, en se concentrant particulièrement sur l’estimation des ressources de calcul au cours des premières phases de conception. L’étude passe en revue l’évolution historique des architectures E/E, soulignant la complexité croissante et les limites des systèmes décentralisés traditionnelsau cours de l’évolution de l’industrie automobile. L’énoncé du problème souligne la nécessité d’une estimation précise des ressources informatiques au début du processus de conception, en particulier dan

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Texto completo da fonte

Resumo:

<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Maciel, Cristiano Baptista Faria. "A memetic algorithm for logistics network design problems." Master's thesis, Instituto Superior de Economia e Gestão, 2014. http://hdl.handle.net/10400.5/8601.

Texto completo da fonte

Resumo:

Mestrado em Decisão Económica e Empresarial<br>Neste trabalho, um algoritmo memético é desenvolvido com o intuito de ser aplicado a uma rede logística, com três níveis, múltiplos períodos, seleção do meio de transporte e com recurso a outsourcing. O algoritmo memético pode ser aplicado a uma rede logística existente, no sentido de otimizar a sua configuração ou, se necessário, pode ser utilizado para criar uma rede logística de raiz. A produção pode ser internalizada e é permitido o envio direto de produtos para os clientes. Neste problema, as capacidades das diferentes infraestruturas podem s

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Dementiev, Roman. "Algorithm engineering for large data sets hardware, software, algorithms." Saarbrücken VDM, Müller, 2006. http://d-nb.info/986494429/04.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Dementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Khungurn, Pramook. "Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41662.

Texto completo da fonte

Resumo:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (p. 71-72).<br>Shirayanagi and Sweedler [12] proved that a large class of algorithms on the reals can be modified slightly so that they also work correctly on floating-point numbers. Their main theorem states that, for each input, there exists a precision, called the minimum converging precision (MCP), at and beyond which the modified "stabilized" algorithm follows the same sequence of steps as the original "exact" algorithm. In this thesis

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Johansson, Björn, and Emil Österberg. "Algorithms for Large Matrix Multiplications : Assessment of Strassen's Algorithm." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230742.

Texto completo da fonte

Resumo:

1968 var Strassens algoritm en av de stora genombrotten inom matrisanalyser. I denna rapport kommer teorin av Volker Strassens algoritm för matrismultiplikationer tillsammans med teorier om precisioner att presenteras. Även fördelar med att använda denna algoritm jämfört med naiva matrismultiplikation och dess implikationer, samt hur den presterar jämfört med den naiva algoritmen kommer att presenteras. Strassens algoritm kommer också att bli bedömd på hur dess resultat skiljer sig för olika precisioner när matriserna blir större, samt hur dess teoretiska komplexitet skiljer sig gentemot den e

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Čápek, Pavel. "Srovnání nástrojů pro animaci algoritmů." Master's thesis, Vysoká škola ekonomická v Praze, 2012. http://www.nusl.cz/ntk/nusl-192639.

Texto completo da fonte

Resumo:

The diploma thesis focuses on software tools which enable algorithm animation. In theoretical section of the work are introduced different ways how to present algorithms. Then the field of algorithm animation is described; it's history, development and current state. In the last part of theoretical section are shown possibilities how to use algorithm animation in teaching. Practical section of the thesis focuses on comparison of selected software tools. Selected tools are evaluated based on several criteria. The applications are then compared by multi-criteria decision making methods. Main goa

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Rafique, Abid. "Communication optimization in iterative numerical algorithms : an algorithm-architecture interaction." Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/17837.

Texto completo da fonte

Resumo:

Trading communication with redundant computation can increase the silicon efficiency of common hardware accelerators like FPGA and GPU in accelerating sparse iterative numerical algorithms. While iterative numerical algorithms are extensively used in solving large-scale sparse linear system of equations and eigenvalue problems, they are challenging to accelerate as they spend most of their time in communication-bound operations, like sparse matrix-vector multiply (SpMV) and vector-vector operations. Communication is used in a general sense to mean moving the matrix and the vectors within the c

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Saadane, Sofiane. "Algorithmes stochastiques pour l'apprentissage, l'optimisation et l'approximation du régime stationnaire." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30203/document.

Texto completo da fonte

Resumo:

Dans cette thèse, nous étudions des thématiques autour des algorithmes stochastiques et c'est pour cette raison que nous débuterons ce manuscrit par des éléments généraux sur ces algorithmes en donnant des résultats historiques pour poser les bases de nos travaux. Ensuite, nous étudierons un algorithme de bandit issu des travaux de N arendra et Shapiro dont l'objectif est de déterminer parmi un choix de plusieurs sources laquelle profite le plus à l'utilisateur en évitant toutefois de passer trop de temps à tester celles qui sont moins performantes. Notre but est dans un premier temps de comp

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Glaudin, Lilian. "Stratégies multicouche, avec mémoire, et à métrique variable en méthodes de point fixe pour l'éclatement d'opérateurs monotones et l'optimisation." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS119.

Texto completo da fonte

Resumo:

Plusieurs stratégies sans liens apparents coexistent pour mettre en œuvre les algorithmes de résolution de problèmes d'inclusion monotone dans les espaces hilbertiens. Nous proposons un cadre synthétique permettant d'englober diverses approches algorithmiques pour la construction de point fixe, clarifions et généralisons leur théorie asymptotique, et concevons de nouveaux schémas itératifs pour l'analyse non linéaire et l'optimisation convexe. Notre méthodologie, qui est ancrée sur un modèle de compositions de quasicontractions moyennées, nous permet de faire avancer sur plusieurs fronts la th

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Fontaine, Allyx. "Analyses et preuves formelles d'algorithmes distribués probabilistes." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0091/document.

Texto completo da fonte

Resumo:

L’intérêt porté aux algorithmes probabilistes est, entre autres,dû à leur simplicité. Cependant, leur analyse peut devenir très complexeet ce particulièrement dans le domaine du distribué. Nous mettons en évidencedes algorithmes, optimaux en terme de complexité en bits résolvantles problèmes du MIS et du couplage maximal dans les anneaux, qui suiventle même schéma. Nous élaborons une méthode qui unifie les résultatsde bornes inférieures pour la complexité en bits pour les problèmes duMIS, du couplage maximal et de la coloration. La complexité de ces analysespouvant facilement mener à l’erreur

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Pelikan, Martin. "Hierarchical Bayesian optimization algorithm : toward a new generation of evolutionary algorithms /." Berlin [u.a.] : Springer, 2005. http://www.loc.gov/catdir/toc/fy053/2004116659.html.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Kouchinsky, Alan J. "Determination of smoke algoritm [i.e. algorithm] activation for video image detection." College Park, Md.: University of Maryland, 2007. http://hdl.handle.net/1903/7223.

Texto completo da fonte

Resumo:

Thesis (M.S.) -- University of Maryland, College Park, 2007.<br>Thesis research directed by: Dept of Fire Protection Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Mirzazadeh, Mehdi. "Adaptive Comparison-Based Algorithms for Evaluating Set Queries." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1147.

Texto completo da fonte

Resumo:

In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like "computer AND science" the search engine has to evaluate the union of the sets of documents containing the words "computer" and "science". More complex queries will result in more complex set expressions. In this thesis we consider the problem of evaluation of a set expression with union and intersection as operators and ordered sets as operands.

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

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

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Violich, Stephen Scott. "Fusing Loopless Algorithms for Combinatorial Generation." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1075.

Texto completo da fonte

Resumo:

Loopless algorithms are an interesting challenge in the field of combinatorial generation. These algorithms must generate each combinatorial object from its predecessor in no more than a constant number of instructions, thus achieving theoretically minimal time complexity. This constraint rules out powerful programming techniques such as iteration and recursion, which makes loopless algorithms harder to develop and less intuitive than other algorithms. This thesis discusses a divide-and-conquer approach by which loopless algorithms can be developed more easily and intuitively: fusing loople

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Lin, Han-Hsuan. "Topics in quantum algorithms : adiabatic algorithm, quantum money, and bomb query complexity." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99300.

Texto completo da fonte

Resumo:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 111-115).<br>In this thesis, I present three results on quantum algorithms and their complexity. The first one is a numerical study on the quantum adiabatic algorithm( QAA) . We tested the performance of the QAA on random instances of MAX 2-SAT on 20 qubits and showed 3 strategics that improved QAA's performance, including a counter intuitive strategy of decreasing the overall evolution time. The second result is a security p

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Sauerland, Volkmar [Verfasser]. "Algorithm Engineering for some Complex Practise Problems : Exact Algorithms, Heuristics and Hybrid Evolutionary Algorithms / Volkmar Sauerland." Kiel : Universitätsbibliothek Kiel, 2012. http://d-nb.info/1026442745/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Ramage, Stephen Edward Andrew. "Advances in meta-algorithmic software libraries for distributed automated algorithm configuration." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52809.

Texto completo da fonte

Resumo:

A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its associated design space to produce another algorithm with desirable properties (e.g., faster runtime, better solution quality, ...; see e.g., Hoos [2008]). Many meta-algorithmic procedures have runtimes that are dominated by the runtime of the algorithm being operated on. This holds in particular for automatic algorithm configurators, such as ParamILS, SMAC, and GGA, which serve to optimize the design (expressed through user settable parameters) of an algorithm under certain use cases. Consequentl

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Liakhovitch, Evgueni. "Genetic algorithm using restricted sequence alignments." Ohio : Ohio University, 2000. http://www.ohiolink.edu/etd/view.cgi?ohiou1172598174.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Kang, Seunghwa. "On the design of architecture-aware algorithms for emerging applications." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39503.

Texto completo da fonte

Resumo:

This dissertation maps various kernels and applications to a spectrum of programming models and architectures and also presents architecture-aware algorithms for different systems. The kernels and applications discussed in this dissertation have widely varying computational characteristics. For example, we consider both dense numerical computations and sparse graph algorithms. This dissertation also covers emerging applications from image processing, complex network analysis, and computational biology. We map these problems to diverse multicore processors and manycore accelerators. We also us

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Kim, Yong Joo. "Block Lanczos algorithm." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25715.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Hess, Tylor (Tylor Joseph). "Algorithm deployment platform." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104283.

Texto completo da fonte

Resumo:

Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2016.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 75-81).<br>Algorithm users, such as researchers, clinicians, engineers, and scientists, want to run advanced, custom, new research algorithms. For example, doctors want to run algorithms developed by researchers for clinical applications. These algorithm users see an algorithm as a black box. They want to input data and get results without having to understand the intricacies of algorithm implementation and witho

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Nicholson, Lori Eileen. "Quantum Algorithm Animator." NSUWorks, 2010. http://nsuworks.nova.edu/gscis_etd/262.

Texto completo da fonte

Resumo:

The design and development of quantum algorithms present a challenge, especially for inexperienced computer science students. Despite the numerous common concepts with classical computer science, quantum computation is still considered a branch of theoretical physics not commonly used by computer scientists. Experimental research into the development of a quantum computer makes the use of quantum mechanics in organizing computation more attractive, however the physical realization of a working quantum computer may still be decades away. This study introduces quantum computing to computer scien

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Bailey, James Patrick. "Octanary branching algorithm." Thesis, Kansas State University, 2012. http://hdl.handle.net/2097/13801.

Texto completo da fonte

Resumo:

Master of Science<br>Department of Industrial and Manufacturing Systems Engineering<br>Todd Easton<br>Integer Programs (IP) are a class of discrete optimization that have been used commercially to improve various systems. IPs are often used to reach an optimal financial objective with constraints based upon resources, operations and other restrictions. While incredibly beneficial, IPs have been shown to be NP-complete with many IPs remaining unsolvable. Traditionally, Branch and Bound (BB) has been used to solve IPs. BB is an iterative algorithm that enumerates all potential integer solu

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Wladis, Simon. "Simulating Grover's Algorithm." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-297556.

Texto completo da fonte

Resumo:

The purpose of this paper is to implement and simulate Grover's algorithm on one and several qubits on a classical computer. The theory behind the algorithm and its components are described in detail. This paper provides a proof of concept for one of the most remarkable results in the theory of quantum computation. I have constructed a library in Python to simulate the gates used in the algorithm that can be used up to an arbitrary number of qubits. The results of the simulations are supposed to demonstrate the characteristics of the algorithm and advantages compared to classical search.

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Vin, Emmanuelle. "Genetic algorithm applied to generalized cell formation problems." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210160.

Texto completo da fonte

Resumo:

The objective of the cellular manufacturing is to simplify the management of the<p>manufacturing industries. In regrouping the production of different parts into clusters,<p>the management of the manufacturing is reduced to manage different small<p>entities. One of the most important problems in the cellular manufacturing is the<p>design of these entities called cells. These cells represent a cluster of machines that<p>can be dedicated to the production of one or several parts. The ideal design of a<p>cellular manufacturing is to make these cells totally independent from one another,<p>i.e. th

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Pieterse, Vreda. "Topic Maps for Specifying Algorithm Taxonomies : a case Study using Transitive Closure Algorithms." Thesis, University of Pretoria, 2016. http://hdl.handle.net/2263/59307.

Texto completo da fonte

Resumo:

The need for storing and retrieving knowledge about algorithms is addressed by creating a specialised information management scheme. This scheme is operationalised in terms of a topic map of algorithms. Metadata are specified for the adequate and precise description of algorithms. The specification describes both the data elements (called attributes) that are relevant to algorithms as well as the relationship of attributes to one another. In addition, a process is formalised for gathering data about algorithms and capturing it in the proposed topic map. The proposed process model and

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Majewsky, Stefan. "Training of Hidden Markov models as an instance of the expectation maximization algorithm." Bachelor's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-226903.

Texto completo da fonte

Resumo:

In Natural Language Processing (NLP), speech and text are parsed and generated with language models and parser models, and translated with translation models. Each model contains a set of numerical parameters which are found by applying a suitable training algorithm to a set of training data. Many such training algorithms are instances of the Expectation-Maximization (EM) algorithm. In [BSV15], a generic EM algorithm for NLP is described. This work presents a particular speech model, the Hidden Markov model, and its standard training algorithm, the Baum-Welch algorithm. It is then shown that

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Schröder, Anna Marie. "Unboxing The Algorithm : Understandability And Algorithmic Experience In Intelligent Music Recommendation Systems." Thesis, Malmö universitet, Institutionen för konst, kultur och kommunikation (K3), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-43841.

Texto completo da fonte

Resumo:

After decades of black-boxing the existence of algorithms in technologies of daily need, users lack confidence in handling them. This thesis study investigates the use situation of intelligent music recommendation systems and explores how understandability as a principle drawn from sociology, design, and computing can enhance the algorithmic experience. In a Research-Through-Design approach, the project conducted focus user sessions and an expert interview to explore first-hand insights. The analysis showed that users had limited mental models so far but brought curiosity to learn. Explorative

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Pochet, Juliette. "Evaluation de performance d’une ligne ferroviaire suburbaine partiellement équipée d’un automatisme CBTC." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC005.

Texto completo da fonte

Resumo:

En zone dense, la croissance actuelle du trafic sur les lignes ferroviaires suburbaines conduit les exploitants à déployer des systèmes de contrôle-commande avancés des trains, tels que les systèmes dits « CBTC » (Communication Based Train Control) jusque-là réservés aux systèmes de métro. Les systèmes CBTC mettent en œuvre un pilotage automatique des trains et permettent une amélioration significative des performances. Par ailleurs, ils peuvent inclure un module de supervision de la ligne en charge de réguler la marche des trains en cas d’aléa, améliorant ainsi la robustesse du trafic. Face a

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Lawrence, Andrea Williams. "Empirical studies of the value of algorithm animation in algorithm understanding." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/9213.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Wang, Nan. "A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1504878748832156.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Stults, Ian Collier. "A multi-fidelity analysis selection method using a constrained discrete optimization formulation." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31706.

Texto completo da fonte

Resumo:

Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Mavris, Dimitri; Committee Member: Beeson, Don; Committee Member: Duncan, Scott; Committee Member: German, Brian; Committee Member: Kumar, Viren. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Sehovic, Mirsad, and Markus Carlsson. "Nåbarhetstestning i en baneditor : En undersökning i hur nåbarhetstester kan implementeras i en baneditor samt funktionens potential i att ersätta manuell testning." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-36394.

Texto completo da fonte

Resumo:

Denna studie undersöker om det är möjligt att införa nåbarhetstestning i en baneditor. Testets syfte är att ersätta manuell testing, det vill säga att bankonstruktören inte ska behöva spela igenom banan för att säkerställa att denne kommer kunna nå alla nåbara positioner.För att kunna utföra studien skapas en enkel baneditor som testplattform. Vidare utförs en jämförande studie av flera alternativa algoritmer för att fastställa vilken som är mest passande för nåbarhetstestning i en baneditor.Resultatet från den jämförande studien visade att A* (A star) var den mest passande algoritmen för funk

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Kaur, Harpreet. "Algorithms for solving the Rubik's cube : A study of how to solve the Rubik's cube using two famous approaches: The Thistlewaite's algorithm and IDA* algorithm." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168427.

Texto completo da fonte

Resumo:

There are different computational algorithms for solving the Rubik's cube, such as Thistlewaite's algorithm, Kociemba's algorithm and IDA* algorithm. This thesis evaluates the efficiency of two algorithms by analyzing time, performance and how many moves are required to solve the Rubik's cube. The results show that the Thistlewaite's algorithm is less efficient than the IDA* algorithm based on time and performance. The paper attempts to answer which algorithm is more efficient for solving the Rubik's cube. It is importation to mention that this report could not prove which algorithm is most ef

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Corbineau, Marie-Caroline. "Proximal and interior point optimization strategies in image recovery." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC085/document.

Texto completo da fonte

Resumo:

Les problèmes inverses en traitement d'images peuvent être résolus en utilisant des méthodes variationnelles classiques, des approches basées sur l'apprentissage profond, ou encore des stratégies bayésiennes. Bien que différentes, ces approches nécessitent toutes des algorithmes d'optimisation efficaces. L'opérateur proximal est un outil important pour la minimisation de fonctions non lisses. Dans cette thèse, nous illustrons la polyvalence des algorithmes proximaux en les introduisant dans chacune des trois méthodes de résolution susmentionnées.Tout d'abord, nous considérons une formulation v

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Legay, Sylvain. "Quelques problèmes d'algorithmique et combinatoires en théorie des grapphes." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS030/document.

Texto completo da fonte

Resumo:

Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de sommets et un ensemble d’arêtes, c’est à dire de paires de sommets, qui relient les sommets. Cette thèse traite de différents problèmes de décisions binaires ou de minimisations liés à la notion de graphe, et cherche, pour chacun de ces problèmes, à déterminer sa classe de complexité, ou à fournir un algorithme. Le premier chapitre concerne le problème de trouver le plus petit sous-graphe connexe tropical dans un graphe sommet-colorié, c’est à dire le plus petit sous-graphe connexe contenant toutes l

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Komínek, Jan. "Heuristické algoritmy pro optimalizaci." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2012. http://www.nusl.cz/ntk/nusl-230306.

Texto completo da fonte

Resumo:

This diploma thesis deals with genetic algorithms and their properties. Particular emphasis is placed on finding the influence of mutation and population size. Genetic algorithms are applied on inverse heat conduction problems (IHCP) in the second part of the thesis. Several different approaches and coding methods were tested. Properties of genetic algorithms were improved by definition of two new genetic operators – manipulation and sorting. Reported theoretical findings were tested on the real data of inverse heat conduction problem. The library for easy implementation of GA for solving gene

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Staicu, Laurian. "Multiple query points parallel search algorithm (Comb algorithm) for multimedia database systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59340.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Levitt, Nicholas D. (Nicholas David). "The Kooshball algorithm--a ray tracing region growing algorithm for medical data." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/31053.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Norrod, Forrest Eugene. "The E-algorithm: an automatic test generation algorithm for hardware description languages." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43260.

Texto completo da fonte

Resumo:

Traditional test generation techniques for digital circuits have been rendered inadequate by the increasing levels of integration achieved by VLSI technology. This thesis presents a test generation algorithm, the E-algorithm, that generates tests for circuits described using the VHDL Hardware Description Language. A fault model has been developed that addresses data path faults, faults in control structures, and faults in functional operators. The E-algorithm is able to generate tests for all modeled fault types, and handles a wide variety of circuit types, including sequential circuits. The a

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Janagam, Anirudh, and Saddam Hossen. "Analysis of Network Intrusion Detection System with Machine Learning Algorithms (Deep Reinforcement Learning Algorithm)." Thesis, Blekinge Tekniska Högskola, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17126.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Gargulák, David. "Animace algoritmů v prostředí Silverlight." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236635.

Texto completo da fonte

Resumo:

The goal of this work was to create a program for the animation of algorithms in Silverlight. To develop this Silverlight module, platform .NET and programing language C# were used. This work contains basic information about Silverlight module and similar module named Flash.

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Jannesson, Johan. "Seat heating smart algorithm." Thesis, University West, Department of Technology, Mathematics and Computer Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-338.

Texto completo da fonte

Resumo:

<p>The goal of this project was to build a model and a controller for the seat heater and steering wheel heater on the SAAB cars. SAAB manufactures two different car models 9-3 and 9-5. The goal is to control the seat heater in both car models without any temperature sensor in the seat, this due to cost reduction. Several tests have been carried out booth in climate chambers and during road tests. These tests have in the end lead to a mathematical model for the temperature dependence and this model has been used to design an open loop controller for the seat heater.</p>

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Uzor, Chigozirim. "Compact dynamic optimisation algorithm." Thesis, De Montfort University, 2015. http://hdl.handle.net/2086/13056.

Texto completo da fonte

Resumo:

In recent years, the field of evolutionary dynamic optimisation has seen significant increase in scientific developments and contributions. This is as a result of its relevance in solving academic and real-world problems. Several techniques such as hyper-mutation, hyper-learning, hyper-selection, change detection and many more have been developed specifically for solving dynamic optimisation problems. However, the complex structure of algorithms employing these techniques make them unsuitable for real-world, real-time dynamic optimisation problem using embedded systems with limited memory. The

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Nallagandla, Shilpa. "Radix 2 division algorithm /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1251871361&sid=5&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!