Littérature scientifique sur le sujet « NUMEROUS ALGORITHMS »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « NUMEROUS ALGORITHMS ».
À 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.
Articles de revues sur le sujet "NUMEROUS ALGORITHMS"
Riyad, Wahidul Alam. « Comparative Evaluation of Numerous Optimization Algorithms for Compiling Travel Salesman Problem ». Journal of Advanced Research in Dynamical and Control Systems 12, SP7 (25 juillet 2020) : 877–83. http://dx.doi.org/10.5373/jardcs/v12sp7/20202178.
Texte intégralThompson, William J. « Numerous Neat Algorithms for the Voigt Profile Function ». Computers in Physics 7, no 6 (1993) : 627. http://dx.doi.org/10.1063/1.4823236.
Texte intégralAmbhika, Ms. « Cost-effective Numerous Kernel Learning Algorithms using Low-Rank Interpretation ». International Journal for Research in Applied Science and Engineering Technology 8, no 6 (30 juin 2020) : 136–49. http://dx.doi.org/10.22214/ijraset.2020.6021.
Texte intégralGeetanjli. « Study of Power Control in CDMA System on the basis of optimization Technique ». International Journal of Advanced Research in Computer Science and Software Engineering 7, no 8 (30 août 2017) : 126. http://dx.doi.org/10.23956/ijarcsse.v7i8.38.
Texte intégralGahman, Nicholas, et Vinayak Elangovan. « A Comparison of Document Similarity Algorithms ». International Journal of Artificial Intelligence & ; Applications 14, no 2 (30 mars 2023) : 41–50. http://dx.doi.org/10.5121/ijaia.2023.14204.
Texte intégralTsagris, Michail, et Ioannis Tsamardinos. « Feature selection with the R package MXM ». F1000Research 7 (20 septembre 2018) : 1505. http://dx.doi.org/10.12688/f1000research.16216.1.
Texte intégralVilluendas-Rey, Yenny, Eley Barroso-Cubas, Oscar Camacho-Nieto et Cornelio Yáñez-Márquez. « A General Framework for Mixed and Incomplete Data Clustering Based on Swarm Intelligence Algorithms ». Mathematics 9, no 7 (6 avril 2021) : 786. http://dx.doi.org/10.3390/math9070786.
Texte intégralDey, Nilanjan, et Amira S. Ashour. « Antenna Design and Direction of Arrival Estimation in Meta-Heuristic Paradigm ». International Journal of Service Science, Management, Engineering, and Technology 7, no 3 (juillet 2016) : 1–18. http://dx.doi.org/10.4018/ijssmet.2016070101.
Texte intégralGe, Lina, Jie Wang et Guifen Zhang. « Survey of Consensus Algorithms for Proof of Stake in Blockchain ». Security and Communication Networks 2022 (29 mai 2022) : 1–13. http://dx.doi.org/10.1155/2022/2812526.
Texte intégralHendry Leo Kanickam, S., et L. Jayasimman. « Comparative Analysis of Hash Authentication Algorithms and ECC Based Security Algorithms in Cloud Data ». Asian Journal of Computer Science and Technology 8, no 1 (5 février 2019) : 53–61. http://dx.doi.org/10.51983/ajcst-2019.8.1.2118.
Texte intégralThèses sur le sujet "NUMEROUS ALGORITHMS"
Souza, Lana Priscila. « Criptografia RSA : a teoria dos nÃmeros posta em prÃtica ». Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14834.
Texte intégralDesde o advento da escrita, o envio de mensagens secretas tem sido uma importante maneira de guardar sigilo de informaÃÃes confidenciais. A arte de elaborar mensagens a partir de cÃdigos secretos surge na figura da criptografia que, com o passar do tempo, estende os seus serviÃos Ãs transaÃÃes comerciais realizadas pela internet. O principal algoritmo utilizado pela internet recebe o nome de RSA. Assim, a criptografia RSA codifica nÃmeros de cartÃes de crÃditos, senhas de bancos, nÃmeros de contas e utiliza para isso elementos de uma importante Ãrea da MatemÃtica: a Teoria dos NÃmeros.
Since the advent of writing, sending secret messages has been an important way to maintain confidentiality of sensitive information. The art of crafting messages from secret codes appears in the figure of encryption that over time extends its services to commercial transactions over the Internet. The main algorithm used by the internet is called RSA. Thus, the RSA Encryption encodes credit card numbers, bank passwords, account numbers and uses for that elements of an important area of mathematics: number theory.
Gomes, Natanael Rodrigues. « Algoritmo sequencial para reconhecimento de numerais manuscritos desconectados utilizando redes neurais ». [s.n.], 1996. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261491.
Texte intégralDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-21T03:38:05Z (GMT). No. of bitstreams: 1 Gomes_NatanaelRodrigues_M.pdf: 3843291 bytes, checksum: ea1c445465616bedc519575e7960e649 (MD5) Previous issue date: 1996
Resumo: A principal dificuldade em reconhecimento de caracteres manuscritos está em desenvolver métodos que possibilitem um ótimo índice de reconhecimento, apesar da grande variabilidade dos caracteres. Este trabalho apresenta um sistema para reconhecimento de numerais manuscritos desconectados, baseado na análise da topologia e distribuição pictorial de numerais e no emprego da rede de Hopfield discreta como memória associativa. O processo de classificação de numerais é dividido em dois estágios. No primeiro estágio, o numeral desconhecido é classificado de acordo com características extraídas de sua topologia e distribuição pictorial. Caso isto não seja possível, devido a distorções e ruídos na imagem do numeral desconhecido, a classificação é efetuada no segundo estágio de classificação do sistema, via rede de Hopfield. A rede de Hopfield é implementada de dois modos. No primeiro modo, a rede tem seus pesos calculados pelo método da projeção, no segundo modo, a rede tem os pesos calculados pelo método de síntese para sistemas lineares operando em modo saturado (LSSM). O sistema é testado com 1500 numerais manuscritos, sendo obtido uma taxa de 85% de reconhecimento com o sistema utilizando, no segundo estágio, a rede de Hopfield implementada conforme o primeiro modo. Uma taxa de reconhecimento de 84,4% é obtida com o sistema utilizando, no segundo estágio, a rede de Hopfield implementada de acordo com o segundo modo
Abstract: The main difficultyin handwritten character recognition consists in developing methods that provide a high recognition rate, although of the large degree of variability of the characteres. This work presents a system for recognition of disconnected handwritten numeraIs, based in analysis of the topology and distribution of pixels from the numerals, and application of a discrete Hopfield neural net used as associative memory. ln the system, the process of classification is divided in two stages. ln the first stage, the unknown numeral is classified considering features extracted from its topology and distribution of pixels. lf it is not possible, due to distortions and noise in numeral image, the classificationis effectuated in the second stage, via Hopfield netoThe Hopfield net is implemented of two manners. ln the first manner, the net has weights calculated by projection method and, in the second manner, the net has weights calculated by sinthesis procedures to linear systems operating in the saturated mode (LSSM systems). The system is tested with 1500 handwritten numerals. A recognition rate over 85% is obtained with the system making use in the second stage of the Hopfield net implemented by the first manner. A recognition rate over 84,4% is obtained with the system making use in the second stage of the Hopfield net implemented by the second manner
Mestrado
Mestre em Engenharia Elétrica
Yared, Glauco Ferreira Gazel. « Metodo para a determinação do numero de gaussianas em modelos ocultos de Markov para sistemas de reconhecimento de fala continua ». [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260523.
Texte intégralTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-06T10:44:21Z (GMT). No. of bitstreams: 1 Yared_GlaucoFerreiraGazel_D.pdf: 5774867 bytes, checksum: 49a79d9495ce25c8a69ca34858a956ee (MD5) Previous issue date: 2006
Resumo: Atualmente os sistemas de reconhecimento de fala baseados em HMMs são utilizados em diversas aplicações em tempo real, desde telefones celulares até automóveis. Nesse contexto, um aspecto importante que deve ser considerado é a complexidade dos HMMs, a qual está diretamente relacionada com o custo computacional. Assim, no intuito de permitir a aplicação prática do sistema, é interessante otimizar a complexidade dos HMMs, impondo-se restrições em relação ao desempenho no reconhecimento. Além disso, a otimização da topologia é importante para uma estimação confiável dos parâmetros dos HMMs. Os trabalhos anteriores nesta área utilizam medidas de verossimilhança para a obtenção de sistemas que apresentem um melhor compromisso entre resolução acústica e robustez. Este trabalho apresenta o novo Algoritmo para Eliminação de Gaussianas (GEA), o qual é baseado em uma análise discriminativa e em uma análise interna, para a determinação da complexidade mais apropriada para os HMMs. O novo método é comparado com o Critério de Informação Bayesiano (BIC), com um método baseado em medidas de entropia, com um método discriminativo para o aumento da resolução acústica dos modelos e com os sistemas contendo um número fixo de Gaussianas por estado
Abstract: Nowadays, HMM-based speech recognition systems are used in many real time processing applications, from cell phones to auto mobile automation. In this context, one important aspect to be considered is the HMM complexity, which directly determines the system computational load. So, in order to make the system feasible for practical purposes, it is interesting to optimize the HMM size constrained to a minimum acceptable recognition performance. Furthermore, topology optimization is also important for reliable parameter estimation. Previous works in this area have used likelihood measures in order to obtain models with a better compromise between acoustic resolution and robustness. This work presents the new Gaussian Elimination Algorithm (GEA), which is based on a discriminative analysis and on an internal analysis, for determining the more suitable HMM complexity. The new approach is compared to the classical Bayesian Information Criterion (BIC), to an entropy based method, to a discriminative-based method for increasing the acoustic resolution of the HMMs and also to systems containing a fixed number of Gaussians per state
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica
Girjotas, Andrius. « Transporto priemonių numerių atpažinimo algoritmų analizė bei universalios atpažinimo sistemos teorija ». Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_193526-52512.
Texte intégralAutomatic license plate recognition plays an important role in numerous applications and a number of techniques have been proposed for public institutions or private companies. However, even now it is impossible to design a perfect and operational recognition system. It still leaves a space for creativity and research of the most effective algorithms. The main objective of this dissertation is to analyze alternatives of licese plate localization and other stages of recognition, their efficiency and adaptability. Selected means of this research are such as implementation of algorithms, analysis of testing data and test results. Every stage of recognition process is extremely sensitive to different factors which determinate variation of transitional and final results. This was proven by analysis of alternative algorithms functionality.
Kazlauskas, Tomas. « Transporto priemonių numerių atpažinimo algoritmų analizė bei universalios atpažinimo sistemos teorija ». Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_193534-66751.
Texte intégralAutomatic license plate recognition plays an important role in numerous applications and a number of techniques have been proposed for public institutions or private companies. However, even now it is impossible to design a perfect and operational recognition system. It still leaves a space for creativity and research of the most effective algorithms. The main objective of this dissertation is to analyze alternatives of licese plate localization and other stages of recognition, their efficiency and adaptability. Selected means of this research are such as implementation of algorithms, analysis of testing data and test results. Every stage of recognition process is extremely sensitive to different factors witch determinate variation of transitional and final results. This was proven by analysis of alternative algorithms functionality.
Cunha, Junior Lourival Carlos. « Matemática lúdica na educação de jovens e adultos do Centro de Progressão Penitenciária do Distrito Federal ». Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/4726.
Texte intégralApproved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T13:42:02Z (GMT) No. of bitstreams: 2 Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-10-22T13:42:02Z (GMT). No. of bitstreams: 2 Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-05-25
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This dissertation aims to analyze how the use of mathematical tricks, educational games and alternative algorithms for multiplication and Division of integers contribute to learning of multiplication and Division operations between positive integers. Research participants were students of a class of adult and youth education of the 2o segment of the Central Penitentiary Progression of Distrito Federal (CPP-DF). The analysis of the results was made from questionnaires answered by the students and observations by the teacher during class. The introduction of mathematical operations took place initially by mathematical tricks, then were presented alternative ways to perform them later manipulation of new algorithms, unraveling the tricks and finally organizing with mathematical games. The participants demonstrated commitment, dedication and interest in the tricks, games and alternative algorithms. The objective of this work was achieved. We realized that there was in fact an improvement in pupils ’ learning.
Esta dissertação tem como objetivo analisar como o uso de truques matemáticos, jogos pedagógicos e algoritmos alternativos para a multiplicação e divisão de números inteiros contribuem para o aprendizado das operações multiplicação e divisão entre números inteiros positivos. Os participantes da pesquisa foram alunos de uma turma de Educação de Jovens e Adultos do 2o Segmento do Centro de Progressão Penitenciária do Distrito Federal (CPP-DF). A análise dos resultados foi feita a partir de questionários respondidos pelos alunos e observações realizadas pelo professor durante as aulas. A introdução das operações matemáticas ocorreu inicialmente por truques matemáticos, em seguida foram apresentadas formas alternativas de realizá-las, posteriormente a manipulação dos novos algoritmos, desvendando os truques e finalmente sistematizando com jogos matemáticos. Os participantes demonstraram empenho, dedicação e interesse em relação aos truques, jogos e aos algoritmos alternativos. O objetivo do trabalho foi alcançado. Percebemos que houve de fato uma melhoria na aprendizagem dos alunos.
Sousa, Antonio Nilson Laurindo [UNESP]. « Criptografia de chave pública, criptografia RSA ». Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/94349.
Texte intégralEste trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler’s totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
Sousa, Antonio Nilson Laurindo. « Criptografia de chave pública, criptografia RSA / ». Rio Claro, 2013. http://hdl.handle.net/11449/94349.
Texte intégralBanca: Aldicio José Miranda
Banca: Henrique Lazari
Resumo: Este trabalho apresenta a criptografia, que é estudada desde a antiguidade e suas técnicas hoje consistem basicamente em conceitos matemáticos. Os números inteiros prestam um papel importante na criptografia de chave pública RSA, onde são apresentados alguns conceitos importantes, propriedades e resultados desse conjunto, destacando as relações com os números primos, a função de Euler e a operação módulo, conhecida como problema do logaritmo discreto. Apresentam-se os fundamentos da Criptografia de Chave Pública RSA, em que a base é a cifra assimétrica, mostrando a garantia da privacidade e assinatura das mensagens. Finaliza-se com a ideia do protocolo de criptografia RSA, a construção de um sistema de correios eletrônico, cuja essência é o método para estabelecer uma criptografia de chave pública RSA, baseada no conceito apresentado por Diffie e Hellman
Abstract: This dissertation presents Cryptography, which is studied since the ancient times and whose techniques consist basically of mathematical concepts. The integers play an important role on the Public Key Cryptography RSA, for which are presented some important results and properties of this set, emphasizing its relations with prime numbers, Euler's totient function and the modulo operation, also known as the problem of discrete logarithm. We present the foundations of the Public Key Cryptography RSA, whose basis is the asymmetric cipher, showing the privacy security of the messages. It ends with the idea of the RSA cryptography protocol, a construction of an electronic mail system, whose gist lies in the method used to establish a Public Key Criptography system RSA, based on the concept presented by Diffie and Hellman
Mestre
Silva, Rogerio Sigrist. « Algoritmos de sintese de Pipeline de processadores para sistemas embutidos : minimização de custos, numero de processadores e latencia ». [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260077.
Texte intégralDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-07T23:40:08Z (GMT). No. of bitstreams: 1 Silva_RogerioSigrist_M.pdf: 816659 bytes, checksum: 206ce45bc9176489805fd6c7f8f0e260 (MD5) Previous issue date: 2006
Resumo: Este trabalho descreve três algoritmos para a síntese de sistemas embutidos atendendo à restrição de desempenho representada pela taxa de chegada dos dados, através de uma estrutura de pipeline de processadores para execução das tarefas, ao mesmo tempo em que minimizam diferentes parâmetros de qualidade dos sistemas: número de processadores; custo e latência total. Os algoritmos realizam o particionamento hardware-software das tarefas, a alocação dos processadores, o mapeamento e escalonamento das tarefas. A alocação de processadores e o mapeamento e escalonamento de tarefas são problemas classificados como NP-Completo e, portanto, foram aplicados métodos heurísticos para suas resoluções. Como exemplos de aplicação são apresentados os pipelines sintetizados pelos algoritmos para grafos sintéticos e para um compressor de áudio digital (AC3). Os pipelines sintetizados atingem métricas de qualidade superiores a outros algoritmos publicados
Abstract: This work presents three heuristics for sinthesizing pipelined embedded systems that satisfy a throughput constraint derived from the maximum input data are adopting a pipeline structure of processors while minimizing system quality parameters: cost, number of processors, or number of stages. The algorithms perform tasks hardware-software partitioning, processors allocation and task mapping and scheduling. Since processors allocation and task mapping and scheduling are NP-Complete problems, heuristics methods were applied. The examples present the pipelines synthesized by the algorithms for large synthetic systems comparing the quality parameters minimization results and for a real audio compressor (AC3) application. The pipelines reached quality metrics higher than other published algorithms
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Rodrigues, Andressa Carla. « As quatro operações matemáticas : das dificuldades ao processo ensino e aprendizagem / ». São José do Rio Preto, 2019. http://hdl.handle.net/11449/181901.
Texte intégralBanca: Rúbia Barcelos Amaral Schio
Banca: Évelin Meneguesso Barbaresco
Resumo: No decorrer dos anos, pelas experiências vivenciadas em sala de aula, nos Anos Finais do Ensino Fundamental e no Ensino Médio, cada vez mais foram observadas dificuldades dos alunos nos cálculos simples, em problemas na matemática e na física. Erros conceituais, nos algoritmos, motivaram-nos a escrever este trabalho para auxiliar professores no processo ensino e aprendizagem das quatro operações no conjunto dos números naturais, a fim de amenizar as dificuldades dos alunos. O objetivo do trabalho é avaliar e diagnosticar dificuldades nos cálculos que envolvem as operações fundamentais e básicas da matemática, aprimorando a forma de ensiná-las aos alunos. Conceitos importantes serão apresentados, como o sistema de numeração decimal, a definição do conjunto dos números naturais e as quatro operações matemáticas. Os algoritmos da decomposição e usual serão explorados com o uso do ábaco de papel e com o material dourado, destacando-se as propriedades associativa e comutativa da adição, assim como as distributiva, associativa e comutativa da multiplicação. Considerando as dificuldades apresentadas no diagnóstico, propõem-se atividades com o material dourado explorando conceitos e instigando o uso dos algoritmos para a compreensão das trocas das ordens, quando necessário. Em síntese, este trabalho apresenta uma metodologia alternativa para melhorar o desempenho dos alunos nos cálculos que envolvem as quatro operações
Abstract: Over the years, experiences in the classroom, the Final Years of Elementary School and High School have seen more and more difficulties for students in simple calculations, problems in mathematics and in physics. Conceptual errors in the algorithms motivated us to write this work to help teachers in the teaching and learning process of the four operations in the set of natural numbers in order to ease the students' difficulties. The purpose of this paper is to evaluate and diagnose difficulties in calculations involving fundamental and basic mathematical operations, improving the way students are taught. Important concepts will be presented, such as the decimal numbering system, the definition of the set of natural numbers and the four mathematical operations. The usual decomposition algorithms will be explored with the use of the paper abacus and the gold material, emphasizing the associative and commutative properties of addition, as well as the distributive, associative and commutative multiplication. Considering the difficulties presented in the diagnosis, activities are proposed with the golden material exploring concepts and instigating the use of the algorithms to understand the order exchanges, when necessary. In summary, this paper presents an alternative methodology to improve students' performance in the calculations involving the four operations
Mestre
Livres sur le sujet "NUMEROUS ALGORITHMS"
Image processing of edge and surface defects : Theoretical basis of adaptive algorithms with numerous practical applications. Heidelberg : Springer, 2009.
Trouver le texte intégralHege, Hans-Christian. Mathematical Visualization : Algorithms, Applications and Numerics. Berlin, Heidelberg : Springer Berlin Heidelberg, 1998.
Trouver le texte intégral1954-, Hege Hans-Christian, et Polthier Konrad, dir. Mathematical visualization : Algorithms, applications, and numerics. Berlin : Springer, 1998.
Trouver le texte intégralAnalytic methods in the analysis and design of number-theoretic algorithms. Cambridge, Mass : MIT Press, 1985.
Trouver le texte intégralKrämer, Walter. Scientific Computing, Validated Numerics, Interval Methods. Boston, MA : Springer US, 2001.
Trouver le texte intégralTantar, Emilia. EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013.
Trouver le texte intégralAllard, André. Muhammad ibn Musa al-Khwarizmi : Le calcul indien (algorismus) : histoire des textes, édition critique, traduction et commentaire des plus anciennes versions latines remaniées du XIIe siècle. Namur : Société des Études Classique, 1992.
Trouver le texte intégralKhuwārizmī, Muḥammad ibn Mūsá. Le calcul indien (Algorismus) : Histoire des textes, édition critique, traduction et commentaire des plus anciennes versions latines remaniées du XIIe siècle. Paris : A. Blanchard, 1992.
Trouver le texte intégralVassiliadis, Vassilios, et Georgios Dounias. Algorithmic Trading based on Biologically Inspired Algorithms. Sous la direction de Shu-Heng Chen, Mak Kaboudan et Ye-Rong Du. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199844371.013.11.
Texte intégralCoolen, A. C. C., A. Annibale et E. S. Roberts. Network growth algorithms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0008.
Texte intégralChapitres de livres sur le sujet "NUMEROUS ALGORITHMS"
Mendy Nefale, Mpho, et Ritesh Ajoodha. « Using Numerous Biographical and Enrolling Observations to Predict Student Performance ». Dans Algorithms for Intelligent Systems, 649–60. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7041-2_55.
Texte intégralKumar, Karanam Sunil, et N. P. Kavya. « Computational Contextual Framework for Dynamic Tracking of Numerous Mobile Object ». Dans Data Science and Algorithms in Systems, 751–61. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21438-7_63.
Texte intégralDave, Jay. « An Optimised Robust Model for Big Data Security on the Cloud Environment : The Numerous User-Level Data Compaction ». Dans Algorithms for Intelligent Systems, 209–16. Singapore : Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-4936-6_23.
Texte intégralMeyer, Ulrich, et Manuel Penschuck. « Generating Synthetic Graph Data from Random Network Models ». Dans Lecture Notes in Computer Science, 21–38. Cham : Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_2.
Texte intégralYoshida, Yuichi. « Constant-Time Algorithms for Continuous Optimization Problems ». Dans Sublinear Computation Paradigm, 31–45. Singapore : Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_3.
Texte intégralHavlena, Vojtěch, Ondřej Lengál, Yong Li, Barbora Šmahlíková et Andrea Turrini. « Modular Mix-and-Match Complementation of Büchi Automata ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 249–70. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_13.
Texte intégralCortes, João, Inês Lynce et Vasco Manquinho. « New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 55–73. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_7.
Texte intégralGreiner-Petter, André, Howard S. Cohl, Abdou Youssef, Moritz Schubotz, Avi Trost, Rajen Dey, Akiko Aizawa et Bela Gipp. « Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 87–105. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_5.
Texte intégralTasneem, Rayeesa, et M. A. Jabbar. « An Insight into Load Balancing in Cloud Computing ». Dans Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 1125–40. Singapore : Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_113.
Texte intégralChatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen et Andreas Pavlogiannis. « Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis ». Dans Programming Languages and Systems, 112–40. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_5.
Texte intégralActes de conférences sur le sujet "NUMEROUS ALGORITHMS"
Saraswat, Shipra, Neetu Faujdar et Sachin Sharma. « Comparative Examination of Fake News Recognition Using an Ensemble of Numerous Machine Learning Algorithms ». Dans 2023 6th International Conference on Information Systems and Computer Networks (ISCON). IEEE, 2023. http://dx.doi.org/10.1109/iscon57294.2023.10111965.
Texte intégralKwong, John Chris T., Felan Carlo C. Garcia, Patricia Angela R. Abu et Rosula S. J. Reyes. « Emotion Recognition via Facial Expression : Utilization of Numerous Feature Descriptors in Different Machine Learning Algorithms ». Dans TENCON 2018 - 2018 IEEE Region 10 Conference. IEEE, 2018. http://dx.doi.org/10.1109/tencon.2018.8650192.
Texte intégralKanungo, T., M. Y. Jaisimha, J. Palmer et R. M. Haralick. « Methodology for analyzing the performance of detection tasks ». Dans OSA Annual Meeting. Washington, D.C. : Optica Publishing Group, 1992. http://dx.doi.org/10.1364/oam.1992.fcc3.
Texte intégralZhang, Yihan, Meikang Qiu et Hongchang Gao. « Communication-Efficient Stochastic Gradient Descent Ascent with Momentum Algorithms ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/512.
Texte intégralShellshear, Evan, Johan S. Carlson et Robert Bohlin. « A Combinatorial Packing Algorithm and Standard Trunk Geometry for ISO Luggage Packing ». Dans ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70778.
Texte intégralGou, J. B., Y. X. Chu et Z. X. Li. « A Geometric Theory for Form, Profile and Orientation Tolerances : Evaluation Algorithms and Simulation Results ». Dans ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dfm-5744.
Texte intégralAslanides, John, Jan Leike et Marcus Hutter. « Universal Reinforcement Learning Algorithms : Survey and Experiments ». Dans Twenty-Sixth International Joint Conference on Artificial Intelligence. California : International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/194.
Texte intégralWest, A. C., et S. A. Sherif. « Optimization of Multistage Vapor Compression Systems Employing Genetic Algorithms ». Dans ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72695.
Texte intégralMatsugu, Shohei, Yasuhiro Fujiwara et Hiroaki Shiokawa. « Uncovering the Largest Community in Social Networks at Scale ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/250.
Texte intégralTian, Yinghui, et Mark J. Cassidy. « Explicit and Implicit Integration Algorithms for an Elastoplastic Pipe-Soil Interaction Macroelement Model ». Dans ASME 2008 27th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2008. http://dx.doi.org/10.1115/omae2008-57237.
Texte intégralRapports d'organisations sur le sujet "NUMEROUS ALGORITHMS"
Lorenz, Markus. Auswirkungen des Decoy-Effekts auf die Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850013.
Texte intégralBreton, Daniel. A study on the Delta-Bullington irregular terrain radiofrequency propagation model : assessing model suitability for use in decision support tools. Engineer Research and Development Center (U.S.), janvier 2022. http://dx.doi.org/10.21079/11681/42780.
Texte intégralGrace, Dr Golla Reethi Shiny, Dr Anu K., Dr Pratyusha Choudary G. et Dr M. v. PATTERN OF THE HEMATOLOGICAL PARAMETERS IN COVID-19 PATIENTS. World Wide Journals, février 2023. http://dx.doi.org/10.36106/ijar/5106302.
Texte intégralPound, B. G. GRI-99-0000 Gap Analysis of the GRI Research Program on Internal Corrosion. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), décembre 1999. http://dx.doi.org/10.55274/r0010720.
Texte intégralSaltus, Christina, Molly Reif et Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), octobre 2021. http://dx.doi.org/10.21079/11681/42240.
Texte intégralSaltus, Christina, Molly Reif et Richard Johansen. waterquality for ArcGIS Pro Toolbox : user's guide. Engineer Research and Development Center (U.S.), septembre 2022. http://dx.doi.org/10.21079/11681/45362.
Texte intégralBourdeau, J. E., et R. D. Dyer. Regional-scale lake-sediment sampling and analytical protocols with examples from the Geological Survey of Canada. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331911.
Texte intégralZhang, Yongping, Wen Cheng et Xudong Jia. Enhancement of Multimodal Traffic Safety in High-Quality Transit Areas. Mineta Transportation Institute, février 2021. http://dx.doi.org/10.31979/mti.2021.1920.
Texte intégralFourie et Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), avril 2002. http://dx.doi.org/10.55274/r0010624.
Texte intégral