Dissertations / Theses on the topic 'Software algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Software algorithm.'
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.
Dementiev, Roman. "Algorithm engineering for large data sets hardware, software, algorithms." Saarbrücken VDM, Müller, 2006. http://d-nb.info/986494429/04.
Full textDementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.
Full textRamage, 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.
Full textScience, Faculty of
Computer Science, Department of
Graduate
Berry, Thomas. "Algorithm engineering : string processing." Thesis, Liverpool John Moores University, 2002. http://researchonline.ljmu.ac.uk/4973/.
Full textCouto, Rafael Carvalho. "Desenvolvimento e aplicação do software MGA (Molecular Genetic Algorithm)." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/7512.
Full textApproved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2017-07-07T20:26:09Z (GMT) No. of bitstreams: 2 Dissertação - Rafael Carvalho Couto - 2013.pdf: 41193945 bytes, checksum: 74a020dad23640afb84a085b841b91aa (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-07-07T20:26:10Z (GMT). No. of bitstreams: 2 Dissertação - Rafael Carvalho Couto - 2013.pdf: 41193945 bytes, checksum: 74a020dad23640afb84a085b841b91aa (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2013-04-15
This work focuses on the development of the software MGA, which aims to determine the lowest energy structures of a given molecular system, using Genetic Algorithm (GA). The GA is a method of artificial intelligence that was developed to work with finding the best solutions of the specified conditions, ie, an algorithm that seeks the best answer desired, an optimal result. The MGA uses three techniques: Random Search (RS), Noninclusive Genetic Algorithm (NGA), Inclusive Genetic Algorithm (IGA). The last one is characterized by a new type of evolutionary strategy that allows in a single calculation and a single cycle, obtain several minimum of the potential energy surface. For optimum operation of the algorithm, was made an optimization of the parameters used in MGA, through response surface methodology. Using the techniques RS, IGA and NGA, were determined 141 distinct molecular structures of the amino acid asparagine. In the electronic structure calculations were considered the semi-empirical methods PM3, AM1 and RM1; and DFT potentials, with basis sets 6-311G ** and PC1. The RS determined the Global Minimum (GM) with ease, for the different potentials used, and proved that it’s quite useful in determining molecular geometries where there is no accuracy in the determination of local minima in order of energy. The NGA is efficient in determining the GM, performing in a shorter time, if compared to RS and IGA. The IGA proved to be a more robust method than the others, because in addition to determining the GM, it can find the local minima in order of energy. Performing calculations on an intermediate time of RS and NGA, the IGA determined the GM as the NGA, and found structures that were not founded using RS. The GM’s of asparagine determined using the potentials PC1, PM3, AM1 and RM1 have a large structural difference. This demonstrates that different potencials used in the electronic structure calculations may lead to different results. By analyzing the structures obtained for potentials PC1, PM3, AM1 and RM1, using the IGA, it appears that there is a difference in the topology of the potential energy surface of these potentials.
O presente trabalho é focado no desenvolvimento do software MGA, que tem como objetivo a determinação das estruturas de menor energia de um dado sistema molecular, utilizando o Algoritmo Genético (AG). O AG é um método de inteligência artificial que foi desenvolvido para trabalhar com a procura de soluções que melhor atendam as condições especificadas, isto é, um algoritmo que procura a melhor resposta desejada, um resultado ótimo. O MGA utiliza três técnicas: Busca Aleatória (RS), Algoritmo Genético Não-inclusivo (NGA), Algoritmo Genético Inclusivo (IGA). Este último é caracterizado por um novo tipo de estratégia evolutiva que permite em um único cálculo e um único ciclo evolucionário obter diversos mínimos da superfície de energia potencial. Para o melhor funcionamento do algoritmo, foi feita uma otimização dos parâmetros utilizados do MGA, através da metodologia de superfície de resposta. Utilizando as técnicas RS, NGA e IGA, foram determinadas 141 estruturas moleculares distintas do aminoácido asparagina. Nos cálculos de estrutura eletrônica foram considerados os métodos semi-empíricos PM3, AM1 e RM1; e potenciais DFT, com os conjuntos de base 6-311G** e PC1. O RS determinou o Mínimo Global (GM) com facilidade, para os diferentes potenciais utilizados, e se mostrou bastante útil na determinação de geometrias moleculares onde não há um rigor na determinação de mínimos locais em ordem de energia. O NGA é eficiente na determinaçãoao do GM, realizando em um menor tempo, se comparado ao RS e IGA. O IGA mostrou-se um método mais robusto que os outros, pois além de determinar o GM é possível encontrar os mínimos locais em ordem de energia. Realizando cálculos em um tempo intermediário ao RS e NGA, o IGA determinou o GM assim como o NGA, e encontrou estruturas que não foram possíveis utilizando o RS. Os GM’s da asparagina determinados utilizando os potenciais PC1, PM3, AM1 e RM1 possuem uma grande diferença estrutural. Isto demonstra que diferentes potencias utilizados nos cálculos de estrutura eletrônica podem levar a diferentes resultados. Ao analisarmos as estruturas obtidas para os potenciais PC1, PM3, AM1 e RM1, utilizando o IGA, constata-se que há uma diferença na topologia de suas superfícies de energia potencial.
Panella, Nicola. "Software implementation of a BMS algorithm for automotive application." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.
Find full textGross, Hans-Gerhard. "Measuring evolutionary testability of real-time software." Thesis, University of South Wales, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365087.
Full textMcLoone, M. P. "Generic silicon architectures for encryption algorithm." Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269123.
Full textJung, Young Je. "Data compression and archiving software implementation and their algorithm comparison." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/26958.
Full textBenage, William Fred. "A fault-tolerant software algorithm for a network of transputers." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27051.
Full textReiss, Agnieszka. "Software implementation of a video resampling algorithm on the TMS320C80." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/43283.
Full textCarroll, Kevin M., John P. Wagle, Kimitake Sato, Brad H. DeWeese, Satoshi Mizuguchi, and Michael H. Stone. "Reliability of a Commercially Available and Algorithm-Based Kinetic Analysis Software Compared to Manual-Based Software." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etsu-works/4654.
Full textHopson, Benjamin Thomas Ken. "Techniques of design optimisation for algorithms implemented in software." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/20435.
Full textPoggiolini, Mario. "The feature detection rule and its application within the negative selection algorithm." Diss., Pretoria : [s.n.], 2009. http://upetd.up.ac.za/thesis/available/etd-06262009-112502/.
Full textLynch, Michael Andrew. "Algorithm to layout (ATL) systems for VLSI design." Thesis, University of Newcastle Upon Tyne, 1986. http://hdl.handle.net/10443/2060.
Full textMartins, Wellington Santos. "Algorithm performance on a general purpose parallel computer." Thesis, University of East Anglia, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296870.
Full textStarefors, Henrik, and Rasmus Persson. "MLID : A multilabelextension of the ID3 algorithm." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13667.
Full textSrivastava, Anurag. "Generalized Event Tree Algorithm and Software for Dam Safety Risk Analysis." DigitalCommons@USU, 2008. https://digitalcommons.usu.edu/etd/32.
Full textOuerd, Messaouda. "An algorithm directed computer aided software engineering (CASE) environment for C." Thesis, University of Ottawa (Canada), 1990. http://hdl.handle.net/10393/5964.
Full textStenlund, Sebastian. "Testing Safety Critical Avionics Software Using LBTest." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-133645.
Full textLi, Xiaoli. "A map-growing localization algorithm for ad-hoc sensor networks /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418044.
Full textKressner, Daniel. "Numerical Methods for Structured Matrix Factorizations." [S.l. : s.n.], 2001. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10047770.
Full textJohnson, Donald C. "Application of a genetic algorithm to optimize staffing levels in software development." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA293725.
Full text"December 1994." Thesis advisor(s): B. Ramesh, T. Hamid. Includes bibliographical references. Also available online.
Elliott, Donald M. "Application of a genetic algorithm to optimize quality assurance in software development." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from the National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA273193.
Full textThesis advisor(s): Ramesh, B. ; Abdel-Hamid, Tarek K. "September 1993." Includes bibliographical references. Also available online.
Gdura, Youssef Omran. "C++ software for computing and visualizing 2-D manifolds using Henderson's algorithm." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ64078.pdf.
Full textShi, Shengxian. "Development of a bootstrap filter PTV algorithm and a smart PIV software." Thesis, University of Liverpool, 2009. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.533939.
Full textZarate, Orozco Ismael. "Software and Hardware-In-The-Loop Modeling of an Audio Watermarking Algorithm." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33221/.
Full textCzerny, Maximilian. "Automated software testing : Evaluation of Angluin's L* algorithm and applications in practice." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146018.
Full textSánchez-Rey, Roberto. "Algorithm and related software to detect human bodies in an indoor environment." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3190.
Full textRoio, Denis. "Algorithmic sovereignty." Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/11101.
Full textSilva, Ricardo João Besteiro e. "A behavioral analysis tool for models of software systems." Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/4023.
Full textProcess calculi are simple languages which permit modeling of concurrent systems so that they can be verified for correctness. We can analyze concurrent systems based on process calculi by either comparing a representation of the actual implementation with a simpler specification for equivalence, or by verifying whether desired properties described in an adequate logic hold. Strong bisimulation equivalence is one of many equivalence relations defined on process calculi to aid in the verification of concurrent software. This equivalence relation relates processes which exhibit the same behavior, i.e. perform the same transitions, as equivalent regardless of internal implementation details. Logics to reason about processes range from those which describe temporal properties – how properties evolve during the course of a process’ life – behavioral properties – which actions a process is capable of performing – and spatial properties – what components compose a process and how are they connected. Model checking consists of verifying if a model, in our case a process, satisfies a given property. Model checking techniques are quite popular in conjunction with process calculi to aid in the verification of the correctness of concurrent systems. In this thesis we address the problems of checking bisimilarity between processess using characteristic formulae, which are formulae used to fully describe a process’ behavior. We implement some facilities to allow bisimilarity verification in the Spatial Logic Model Checker tool. As a result of adding these facilities we also extend the SLMC tool with an extra modality in the logic it uses to reason about processes. We have also added the possibility to define mutually recursive properties in the tool and enhanced the model checking algorithm with a cache to prevent redundant, time-consuming checks to be performed.
Sen, Caner. "Tsunami Source Inversion Using Genetic Algorithm." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612939/index.pdf.
Full texts Center for Tsunami Research is based on the concept of a pre-computed tsunami database which includes tsunami model results from Mw 7.5 earthquakes called tsunami source functions. Tsunami source functions are placed along the subduction zones of the oceans of the world in several rows. Linearity of tsunami propagation in an open ocean allows scaling and/or combination of the pre-computed tsunami source functions. An offshore scenario is obtained through inverting scaled and/or combined tsunami source functions against Deep-ocean Assessment and Reporting of Tsunami (DART) buoy measurements. A graphical user interface called Genetic Algorithm for INversion (GAIN) was developed in MATLAB using general optimization toolbox to perform an inversion. The 15 November 2006 Kuril and 27 February 2010 Chile tsunamis are chosen as case studies. One and/or several DART buoy measurement(s) is/are used to test different error minimization functions with/without earthquake magnitude as constraint. The inversion results are discussed comparing the forecasting model results with the tide gage measurements.
Buys, Stefan. "Genetic algorithm for Artificial Neural Network training for the purpose of Automated Part Recognition." Thesis, Nelson Mandela Metropolitan University, 2012. http://hdl.handle.net/10948/d1008356.
Full textMahdavi, Kiarash. "A clustering genetic algorithm for software modularisation with a multiple hill climbing approach." Thesis, Brunel University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.425197.
Full textMakai, Matthew Charles. "Incorporating Design Knowledge into Genetic Algorithm-based White-Box Software Test Case Generators." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/32029.
Full textMaster of Science
Pradhan, Pushkar P. "Efficient group membership algorithm for ad hoc networks." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000593.
Full textMahmood, Qazafi. "LC - an effective classification based association rule mining algorithm." Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/24274/.
Full textWang, Xiaoning. "A Modular Model Checking Algorithm for Cyclic Feature Compositions." Digital WPI, 2005. https://digitalcommons.wpi.edu/etd-theses/64.
Full textWang, Xiaoning. "A modular model checking algorithm for cyclic feature compositions." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-01115-201156/.
Full textKeywords: modular verification; feature-oriented software development; model checking; assume-guarantee reasoning. Includes bibliographical references (p. 72-73).
Peschl, Gabriel. "Comparing restricted propagation grafhs for the similarity flooding algorithm." reponame:Repositório Institucional da UFPR, 2015. http://hdl.handle.net/1884/40436.
Full textDissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa: Curitiba, 26/05/2015
Inclui referências : f.51-54
Resumo: A Engenharia de Software Orientada a Modelos é uma metodologia que utiliza modelos no processo de desenvolvimento de software. Muitas operações sobre esse modelos são necessárias estabelecer links entre modelos distintos, como por exemplo, nas transformação de modelos, nas rastreabilidade de modelos e nas integração de modelos. Neste trabalho, os links são estabelecidos através da operação matching. Com os links estabelecidos é comum calcular os valores de similaridades a eles, além de se indicar um grau de igualdade entre esses links. O Similarity Flooding é um algoritmo bem estabelecido que pode aumentar a similaridade entre os links. O algoritmo é genérico e está provado sua eficiência. Contudo, ele depende de uma estrutura menos genérica para manter a sua eficiência. Neste trabalho, foram codificados 9 métodos distintos de propagações para o Similarity Flooding entre os elementos de metamodelos e modelos. Esses elementos compreendem classes, atributos, referências, instâncias e o tipo dos elementos, por exemplo, Integer, String ou Boolean. Além de verificar a viabilidade desses métodos, 2 casos de estudos são discutidos. No primeiro caso de estudo, foram executados os métodos entre os metamodelos e modelos de Mantis e Bugzilla. Em seguida, foram executados os métodos entre os metamodelos e modelos de AccountOwner e Customer. Por fim, é apresentado um estudo comparativo entre os métodos de propagações codificados com um método genérico, com o objetivo de verificar quais métodos podem ser mais (ou menos) eficiente para o Similarity Flooding, dentre os metamodelos e modelos utilizados. De acordo com os resultados, utilizando técnicas restritas de propagações do SF, as similaridades entre os links melhoraram em relação a execução genérica do algoritmo. Isso porque diminuindo a quantidade de links o SF pode ter um melhor desempenho.
Abstract: In Model-Driven Software Engineering (MDSE), different approaches can be used to establish links between elements of different models for distinct purposes, such as serving as specifications for model transformations. Once the links have been established, it is common to set up a similarity value to indicate equivalence (or lack of) between the elements. Similarity Flooding (SF) is one of the best known algorithms for enhancing the similarity of structurally similar elements. The algorithm is generic and has proven to be efficient. However, it depends on graph-based structure and a less generic encoding. We created nine generic methods to propagate the similarities between links of elements of models. These elements comprise classes, attributes, references, instances and the type of element, e.g., Integer, String or Boolean. In order to verify the viability of these methods, 2 case studies are discussed. In the first case study, we execute our methods between metamodels and models of Mantis and Bugzilla. In the following, the metamodels and models of AccountOwner and Customer are used. At the end, a comparative study of the metamodel-based encoding is presented for the purpose of verifying whether a less generic implementation, involving a lesser number of model elements, based on the metamodel and model structures, might be a viable implementation and adaptation of the SF algorithm. We compare these methods with an implementation comprising all the propagation strutures (non-restricted propagation), which are more similar (though not equivalent) to the original SF implementation. According to the results, using the restricted propagation graphs of the SF, the similarity values between the links has increased in relation to the non-restricted algorithm. This is because reducing the amount of links, will increase the propagation values between the links of elements.
Ataser, Zafer. "Variable Shaped Detector: A Negative Selection Algorithm." Phd thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615629/index.pdf.
Full textMao, Yida 1972. "A metrics based detection of reusable object-oriented software components using machine learning algorithm /." Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21601.
Full textMao, Yida. "A metrics based detection of reusable object-oriented software components using machine learning algorithm." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0028/MQ50828.pdf.
Full textKolb, William Edward 1960. "MICROCOMPUTER BASED AUTOMATIC TRUCK DISPATCHING - SYSTEM MODELING AND SIMULATION (MINING, SOFTWARE, ALGORITHM, OPEN-PIT)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/292092.
Full textNilsson, Gustav, and William Takolander. "Smarta rekommendationer : Rekommendationer på webbsidor framtagna av maskininlärning." Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-39345.
Full textIn today's society machine learning is a growing method to solve certain problems faced by companies worldwide. Many companies have mountains of stored data that are not being utilised. This data can be used in numerous ways to make improvements within these companies. One of the ways is machine learning, it is used more and more these days to generate recommendations. This project's purpose is to make a proof of concept of a machine learning model capable of giving recommendations based on historical data. This proof of concept will serve as guidelines to Centrala Studiestödsnämnden (CSN) in how they should approach machine learning as an alternative to manual recommendations. This is achieved by determining what data is to be used, understanding the data selected and then picking an algorithm suitable for that data. Then the algorithms will be used to create machine learned models which will be tested in various ways to see which works best for the task at hand. Two models are created with different algorithms that both fit the purpose. The models are tested through practical and theoretical tests. The results show that the algorithms are similar in which predicted recommendations they give but have slight variation.
Liu, Xing. "High-performance algorithms and software for large-scale molecular simulation." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53487.
Full textSabih, Ann Faik. "Cognitive smart agents for optimising OpenFlow rules in software defined networks." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/15743.
Full textSen, Tayfun. "Parallel Closet+ Algorithm For Finding Frequent Closed Itemsets." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610742/index.pdf.
Full textWright, Hamish Michael. "A Homogeneous Hierarchical Scripted Vector Classification Network with Optimisation by Genetic Algorithm." Thesis, University of Canterbury. Electrical and Computer Engineering, 2007. http://hdl.handle.net/10092/1191.
Full textTsuruta, Mauricio. "Um estudo sobre a relação entre qualidade e arquitetura de software." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/12/12139/tde-29032011-201659/.
Full textMany sectors of economy depend highly on computing systems: telecommunication, finance, infrastructure, industrial, and others. Thus, the quality of software in these systems is an important item to achieve good performance in these sectors. The software architecture is considered one of the main factors that shape the software quality. This work studies the way software architecture determines the software quality and the possibilities to obtain the desired software quality attributes through specifying appropriate software architecture. The research method is based upon literature review and four approaches to software architecture design process are considered: classic, object oriented, attribute oriented and search oriented. The search oriented approach to software architecture design process is a relatively new field of study and advances are reported in a knowledge area called Search Based Software Engineering. This knowledge area uses metaheuristics techniques to find good solutions to problems found in software engineering. One of the metaheuristic technique most frequently used, the genetic algorithm, is used in an application that follows the search based approach.