Thèses sur le sujet « AMP ALGORITHM »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « AMP ALGORITHM ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Dementiev, 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.
Texte intégralNallagandla, 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.
Texte intégralJonas, Mario Ricardo Edward. « High performance computing and algorithm development : application of dataset development to algorithm parameterization ». Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&.
Texte intégralHan, Tony. « SWASAD Smith & ; Waterman-algorithm-specific ASIC design / ». St. Lucia, Qld, 2001. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe16391.pdf.
Texte intégralAlweh, Mohammad. « Robust algorithm for WiFi network / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1136091901&sid=6&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralKonda, Lakshmana Rao. « An empirical study of TJFast algorithm / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240708321&sid=12&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralMcLoone, 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.
Texte intégralKreslins, Karlis. « A stemming algorithm for Latvian ». Thesis, Loughborough University, 1996. https://dspace.lboro.ac.uk/2134/7433.
Texte intégralKassapakis, E. G. « Studies on a predictive control algorithm ». Thesis, University of Reading, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360726.
Texte intégralHounsinou, Sena Gladys N. « Hardware realization of speech-time warping algorithm / ». Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1650508391&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralZhi, Ruoyu. « A Drift Eliminated Attitude & ; Position Estimation Algorithm In 3D ». ScholarWorks @ UVM, 2016. http://scholarworks.uvm.edu/graddis/450.
Texte intégralAllam, Vineel Reddy. « A novel recovery algorithm for distributed computing environment / ». Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1594491041&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralChirra, Raja Kishore. « A new efficient recovery algorithm for cluster federations / ». Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1404355011&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralLynch, Michael Andrew. « Algorithm to layout (ATL) systems for VLSI design ». Thesis, University of Newcastle Upon Tyne, 1986. http://hdl.handle.net/10443/2060.
Texte intégralMartins, 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.
Texte intégralJiang, Lianjun. « Preconditioning the limited-memory BFGS algorithm ». Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3239445.
Texte intégralKumar, Nandeesh. « Automated task allocation for network processors using genetic algorithm / ». Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1324381471&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralScott, Kara E. « Evaluating an improved algorithm for segregating large geospatial data / ». Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1324372541&sid=24&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralMamillapalli, Sai Praneeth. « A new recovery algorithm for a distributed computing environment / ». Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1456296501&sid=7&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralAnderson, Travis M. « Motion detection algorithm based on the common housefly eye ». Laramie, Wyo. : University of Wyoming, 2007. http://proquest.umi.com/pqdweb?did=1400965531&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Texte intégralMomen, Faisal. « OPTIMIZATION OF THE GENETIC ALGORITHM IN THE SHEHERAZADE WARGAMING SIMULATOR ». Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/203449.
Texte intégralGuthikonda, Haritha. « A NEW FAIR QUEUEING ALGORITHM FOR ROUTING IN STATIC NETWORKS ». Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1967969541&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralThilakawardana, Duminda. « An efficient genetic algorithm application in assembly line balancing ». Thesis, University of Surrey, 2002. http://epubs.surrey.ac.uk/844283/.
Texte intégralCUNHA, FERNANDO BRANDAO LOBATO. « ADAPTATION ALGORITHM OF IIR ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9838@1.
Texte intégralA partir da forma geral do algoritmo de adaptação, é proposto o uso de mais uma variável de projeto, denominada janela. Esta janela tem por objetivo melhorar as características de convergência de algoritmos, cujos parâmetros são partes de estruturas IIR. A introdução das janelas é justificada heuristicamente e seu desempenho é avaliado por meio de diversas simulações de identificação de sistemas. Os resultados obtidos indicam aumentos significativos na velocidade de convergência (cerca de uma ordem de grandeza mais rápido do que os algoritmos atualmente mais usados), na precisão das estimativas dos parâmetros do problema e na robustez dos novos algoritmos (menor número de pólos instáveis durante a adaptação). Estes resultados foram observados em ambientes estacionários e não estacionários, com e sem ruído de medida e com ordem de identificação suficiente ou não.
From the adaptation algorithm general form it is proposed the usage of another design variable, called Window. The goal of this Window is to improve the convergence characteristics of algorithms whose parameters are parts of IIR Structures. The introduction of the Window is heuristically justified and its performance is eventuated by several system identification simulations. The results achieved suggest significant increase in the convergence speed (about one order of magnitude faster than the currently most used algorithms), in the parameter estimation precision and in the new algorithm robusteness (fewer unstable poles during adaptation). These results were observed in sationary and non-stationary environments, with and without measurement noise and with sufficient identification order or not.
MARTINS, ROBERTO CINTRA. « SHOR S FACTORING ALGORITHM ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35511@1.
Texte intégralA dissertação apresenta detalhadamente o algoritmo de fatoração de Shor, tanto em termos de sua execução passo a passo como mediante sua representação em forma de circuito, abordando aspectos tanto de sua parte clássica como de sua parte quântica. Inicialmente são apresentados aspectos de teoria dos números indispensáveis para a compreensão do algoritmo e em seguida são desenvolvidos conceitos e propriedades de mecânica quântica e de informação quântica pertinentes. Em atenção ao caráter eminentemente estocástico do algoritmo realiza-se um estudo de sua fonte estocástica e demonstram-se os principais teoremas que embasam a avaliação de sua probabilidade de sucesso. Desenvolvem-se exemplos de simulação clássica do algoritmo. Finalmente, a eficiência do algoritmo de fatoração de Shor é comparada com a de algoritmos clássicos.
The dissertation presents in detail Shor s factoring algorithm, including its execution step by step and its representation in the form of a circuit, addressing aspects of both its classical and its quantum parts. Aspects of number theory indispensable to understand the algorithm are presented, followed by a development of concepts and properties of quantum mechanics and quantum information. Considering the eminently stochastic character of the algorithm, a study of its stochastic source is carried out and the main theorems that support the evaluation of its probability of success are proved. Examples of classical simulation of the algorithm are developed. Finally, the efficiency of Shor s factoring algorithm is compared with that of classical algorithms.
Nayestani, Naynaz. « A process comparison algorithm / ». Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79252.
Texte intégralIDEF3 diagrams were used for process modeling, a modified PERT network technique was used for process comparison, and the technique incorporated fuzzy data and metric comparison.
Solutions of practical problems showed that the algorithm does not have any limitations for process comparison. While the test data were for time performance only, other metrics can easily be accommodated, such as cost, quality, human resource or energy.
Singh, Payal. « Accounting for spatial variations using spatial autocorrelation and fuzzy classifiers algorithm / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203554991&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralVemuri, Aditya. « A high performance non-blocking checkpointing/recovery algorithm for ring networks / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203587991&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralDontha, Priyadharshini. « A modification to Yang's asynchronous recovery algorithm with direct checkpoint determination / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203588011&sid=23&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralJupally, Vamshi Krishna Rao. « A novel recovery algorithm for concurrent failures in distributed computing environment / ». Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1594491061&sid=13&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralPatsias, Kyriakos. « A HIGH PERFORMANCE GIBBS-SAMPLING ALGORITHM FOR ITEM RESPONSE THEORY MODELS ». Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1796121011&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralKhudhair, Ali Dheyaa. « A Simplified Routing Algorithm for Energy Efficiency in Wireless Sensor Networks ». Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1885751071&sid=8&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralNdungu, Edward Nganga. « A stable pre-whitened NLMS algorithm for acoustic echo cancellation ». Thesis, Loughborough University, 1997. https://dspace.lboro.ac.uk/2134/14117.
Texte intégralMurnion, Shane D. « Neural and genetic algorithm applications in GIS and remote sensing ». Thesis, Queen's University Belfast, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337024.
Texte intégralFarsi, M. « Simplified self-tuning algorithm and model reduction for robot control ». Thesis, University of Newcastle Upon Tyne, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373053.
Texte intégralCutress, Ian James. « Algorithm development in computational electrochemistry ». Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:a1cfb510-3656-4396-84b3-8e67b88d3d2f.
Texte intégralLambert, Geoffrey C. « The development of a unique algorithm for the solution of HVAC system design optimisation problems ». Thesis, University of Liverpool, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359199.
Texte intégralKöpf, Christian Rudolf. « Meta-learning : strategies, implementations, and evaluations for algorithm selection / ». Berlin : Aka, 2006. http://deposit.ddb.de/cgi-bin/dokserv?id=2745748&prov=M&dok_var=1&dok_ext=htm.
Texte intégralCORDEIRO, JOAQUIM PEDRO DE V. « NETWORK SIMPLEX, ALGORITHM E IMPLEMENTATION ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13219@1.
Texte intégralCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Este trabalho busca desenvolver o método Simplex para Redes na solução de problemas de Fluxo de Custo Mínimo. Este método consiste em uma adaptação do método Simplex primal em que são exploradas as características específicas da rede subjacente ao problema ao se buscar a solução ótima em um número finito de árvores geradoras. A árvore geradora ótima será obtida iterativamente através de sucessivas melhorias na estrutura de cada árvore formada. A maior eficiência do Simplex para Redes se dá tanto no menor número de iterações necessárias para se atingir o ótimo, quanto na maior velocidade destas iterações, trata-se, portanto, de um método bastante poderoso na resolução de problemas de Fluxo de Custo Mínimo. Serão, também, abordados aspectos práticos da implementação do algoritmo além da aplicação deste algoritmo implementado em VBA (Visual Basic for Applications) em um problema prático a título de exemplificação.
The current work intends to develop a Network Simplex Method for solving Minimum Cost Flow problems. Such method consists of a primal Simplex Method adaptation in which specific characteristics of the network underlying the problem are investigated by searching for the optimal solution within a finite number of spanning trees. The optimal spanning tree is iteratively obtained through successive structure improvements in each formed tree. The higher efficiency of Network Simplex lies both in fewer iterations necessary to achieve the optimum and in the higher speed of these iterations. Therefore, it is a powerful method for solving Minimum Cost Flow Problems. Practical aspects of implementing the algorithm will be discussed, as well as the algorithm´s implementation in VBA (Visual Basic for Applications) through a practical instance.
Kantheti, Vinod. « Design of an efficient checkpointing-recovery algorithm for distributed cluster computing environment / ». Available to subscribers only, 2005. http://proquest.umi.com/pqdweb?did=1079672401&sid=2&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralTaduri, Manoj Reddy. « A low-overhead non-block check pointing algorithm for distributed computing environment / ». Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1650513331&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralAsefi, Mahdi. « Classification-Based Adaptive Search Algorithm for Video Motion Estimation ». Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2864.
Texte intégralMantas, P. « A directed search algorithm for secondary state assignment of sequential machines ». Thesis, Cranfield University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276370.
Texte intégralUsta, Ö. « A power based digital algorithm for the protection of embedded generators ». Thesis, University of Bath, 1992. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251234.
Texte intégralNguyen, Diep Ngoc. « RESOURCE ALLOCATION STRATEGIES FOR COGNITIVE AND COOPERATIVE MIMO COMMUNICATIONS : ALGORITHM AND PROTOCOL DESIGN ». Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/292674.
Texte intégralPirim, Taner. « A hybrid metaheuristic algorithm for solving capacitated task allocation problems as modified XQX problems / ». Full text available from ProQuest UM Digital Dissertations, 2006. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1335352891&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1218810152&clientId=22256.
Texte intégralOyana, Damalie M. « Implementation of a new data stream clustering algorithm using discrete cosine transformed data / ». Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1203588021&sid=12&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralVenkatraman, Chandrasekar. « Hill climbing digital control algorithm for maximum power point tracking of photovoltaic arrays ». Laramie, Wyo. : University of Wyoming, 2006. http://proquest.umi.com/pqdweb?did=1320938081&sid=2&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Texte intégralFernandes, José Maria Veiga. « Improving direct solar radiation in complex building envelopes with a computational genetic algorithm ». Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1417816821&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Texte intégralJohnson, Amanda R. « A pose estimation algorithm based on points to regions correspondence using multiple viewpoints ». Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1798480891&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Texte intégral