Relevant bibliographies by topics / NUMEROUS ALGORITHMS

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'NUMEROUS ALGORITHMS'

Author: Grafiati
Published: 11 September 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'NUMEROUS ALGORITHMS.'

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

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

Journal articles on the topic "NUMEROUS ALGORITHMS"

1

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 (2020): 877–83. http://dx.doi.org/10.5373/jardcs/v12sp7/20202178.

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

Thompson, 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.

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

Ambhika, Ms. "Cost-effective Numerous Kernel Learning Algorithms using Low-Rank Interpretation." International Journal for Research in Applied Science and Engineering Technology 8, no. 6 (2020): 136–49. http://dx.doi.org/10.22214/ijraset.2020.6021.

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

Geetanjli. "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 (2017): 126. http://dx.doi.org/10.23956/ijarcsse.v7i8.38.

Full text
Abstract:
The power control in CDMA systems, grant numerous users to share resources of the system uniformly between each other, leading to expand capacity. With convenient power control, capacity of CDMA system is immense in contrast of frequency division multiple access (FDMA) and time division multiple access (TDMA). If power control is not achieved numerous problems such as the near-far effect will start to monopolize and consequently will reduce the capacity of the CDMA system. However, when the power control in CDMA systems is implemented, it allows numerous users to share resources of the system
APA, Harvard, Vancouver, ISO, and other styles
5

Gahman, Nicholas, and Vinayak Elangovan. "A Comparison of Document Similarity Algorithms." International Journal of Artificial Intelligence & Applications 14, no. 2 (2023): 41–50. http://dx.doi.org/10.5121/ijaia.2023.14204.

Full text
Abstract:
Document similarity is an important part of Natural Language Processing and is most commonly used forplagiarism-detection and text summarization. Thus, finding the overall most effective document similarity algorithm could have a major positive impact on the field of Natural Language Processing. This report setsout to examine the numerous document similarity algorithms, and determine which ones are the mostuseful. It addresses the most effective document similarity algorithm by categorizing them into 3 types ofdocument similarity algorithms: statistical algorithms, neural networks, and corpus/
APA, Harvard, Vancouver, ISO, and other styles
6

Tsagris, Michail, and Ioannis Tsamardinos. "Feature selection with the R package MXM." F1000Research 7 (September 20, 2018): 1505. http://dx.doi.org/10.12688/f1000research.16216.1.

Full text
Abstract:
Feature (or variable) selection is the process of identifying the minimal set of features with the highest predictive performance on the target variable of interest. Numerous feature selection algorithms have been developed over the years, but only few have been implemented in R as a package. The R package MXM is such an example, which not only offers a variety of feature selection algorithms, but has unique features that make it advantageous over its competitors: a) it contains feature selection algorithms that can treat numerous types of target variables, including continuous, percentages, t
APA, Harvard, Vancouver, ISO, and other styles
7

Villuendas-Rey, Yenny, Eley Barroso-Cubas, Oscar Camacho-Nieto, and Cornelio Yáñez-Márquez. "A General Framework for Mixed and Incomplete Data Clustering Based on Swarm Intelligence Algorithms." Mathematics 9, no. 7 (2021): 786. http://dx.doi.org/10.3390/math9070786.

Full text
Abstract:
Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheu
APA, Harvard, Vancouver, ISO, and other styles
8

Dey, Nilanjan, and 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 (2016): 1–18. http://dx.doi.org/10.4018/ijssmet.2016070101.

Full text
Abstract:
Antennas are considered as a significant component in any wireless system. There are numerous factors and constraints that affect its design. Therefore, recently several algorithms are developed to allow the designers optimize the antenna with respect to numerous different criteria, general constraints and the desired performance characteristics. In recent years there has been an increasing attention to some novel evolutionary techniques, such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Bacteria-Foraging (BF), Biogeography Based Optimization (BB
APA, Harvard, Vancouver, ISO, and other styles
9

Ge, Lina, Jie Wang, and Guifen Zhang. "Survey of Consensus Algorithms for Proof of Stake in Blockchain." Security and Communication Networks 2022 (May 29, 2022): 1–13. http://dx.doi.org/10.1155/2022/2812526.

Full text
Abstract:
As the core of blockchain technology, the consensus algorithm directly affects the security, stability, and decentralisation of the blockchain and numerous other important characteristics. Choosing an appropriate consensus algorithm for different scenarios is currently a challenge in the implementation of blockchain applications. This paper classifies the improvement schemes of proof of stake (PoS) into three categories: PoS-based consensus algorithms, PoS- and PoW-based consensus algorithms, and PoS- and BFT-based consensus algorithms. First, the study introduces the PoS and PoS consensus alg
APA, Harvard, Vancouver, ISO, and other styles
10

Hendry Leo Kanickam, S., and 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 (2019): 53–61. http://dx.doi.org/10.51983/ajcst-2019.8.1.2118.

Full text
Abstract:
Cloud computing is ensuring the security of stored data in cloud computing servers is one of the mainly demanding issues. In Cloud numerous security issues arises such as authentication, integrity and confidentiality. Different encryption techniques attempt to overcome these data security issues to an enormous extent. Hashing algorithm plays an important role in data integrity, message authentication, and digital signature in modern information security. For security purpose using encryption algorithm like ECC (Elliptic Curve Cryptography) and Authentication of data integrity using hashing alg
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "NUMEROUS ALGORITHMS"

1

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.

Full text
Abstract:
CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior<br>Desde 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 um
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Orientador: Lee Luan Ling<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica<br>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<br>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 ma
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
Orientador: Fabio Violaro<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>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<br>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
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
Automatinis transporto priemonių registracijos numerio atpažinimas atlieka svarbų vaidmenį daugelyje programinių paketų, taikomų tiek valstybinėse institucijose, tiek ir privačiose kompanijose, kuriuose yra naudojamos įvairios atpažinimo algoritmų technologijos. Tačiau net ir dabar neįmanoma sukurti idealiai veikiančios sistemos, kuri palieka laisvę efektyviausių algoritmų paieškai. Šio tiriamojo darbo tikslas yra išanalizuoti alternatyvius automobilio numerio lokalizacijos ir kitų atpažinimo etapų algoritmus, jų efektyvumą bei adaptyvumą. Analizė atliekama juos realizuojant ir atliekant tyrim
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
Automatinis transporto priemonių registracijos numerio atpažinimas atlieka svarbų vaidmenį daugelyje programinių paketų, taikomų tiek valstybinėse institucijose, tiek ir privačiose kompanijose, kuriuose yra naudojamos įvairios atpažinimo algoritmų technologijos. Tačiau net ir dabar neįmanoma sukurti idealiai veikiančios sistemos, kuri palieka laisvę efektyviausių algoritmų paieškai. Šio tiriamojo darbo tikslas yra išanalizuoti alternatyvius automobilio numerio lokalizacijos ir kitų atpažinimo etapų algoritmus, jų efektyvumą bei adaptyvumą. Analizė atliekama juos realizuojant ir atliekant tyrim
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T13:38:57Z No. of bitstreams: 2 Dissertação - Lourival Carlos Cunha Junior - 2015.pdf: 8702813 bytes, checksum: 307cfb19927718cfa7a667f109f4768f (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved 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: 9da0b6dfac957114c6a7714714b8
APA, Harvard, Vancouver, ISO, and other styles
7

Sousa, Antonio Nilson Laurindo [UNESP]. "Criptografia de chave pública, criptografia RSA." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/94349.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:27:09Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-08-16Bitstream added on 2014-06-13T20:35:15Z : No. of bitstreams: 1 sousa_anl_me_rcla.pdf: 535933 bytes, checksum: 76cd9ddeb4c3e3c566bae5395dfcaa14 (MD5)<br>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
APA, Harvard, Vancouver, ISO, and other styles
8

Sousa, Antonio Nilson Laurindo. "Criptografia de chave pública, criptografia RSA /." Rio Claro, 2013. http://hdl.handle.net/11449/94349.

Full text
Abstract:
Orientador: Eliris Cristina Rizziolli<br>Banca: Aldicio José Miranda<br>Banca: Henrique Lazari<br>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 Cripto
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
Orientador: Alice Maria B. H. Tokarnia<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>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<br>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,
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
Orientador: Rita de Cássia Pavan Lamas<br>Banca: Rúbia Barcelos Amaral Schio<br>Banca: Évelin Meneguesso Barbaresco<br>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 al
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "NUMEROUS ALGORITHMS"

1

Image processing of edge and surface defects: Theoretical basis of adaptive algorithms with numerous practical applications. Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hege, Hans-Christian. Mathematical Visualization: Algorithms, Applications and Numerics. Springer Berlin Heidelberg, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1954-, Hege Hans-Christian, and Polthier Konrad, eds. Mathematical visualization: Algorithms, applications, and numerics. Springer, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Analytic methods in the analysis and design of number-theoretic algorithms. MIT Press, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Krämer, Walter. Scientific Computing, Validated Numerics, Interval Methods. Springer US, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tantar, Emilia. EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation. Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Allard, 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. Société des Études Classique, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Khuwā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. A. Blanchard, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vassiliadis, Vassilios, and Georgios Dounias. Algorithmic Trading based on Biologically Inspired Algorithms. Edited by Shu-Heng Chen, Mak Kaboudan, and Ye-Rong Du. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199844371.013.11.

Full text
Abstract:
The chapter discusses algorithmic trading, which refers to any automated process, consisting of a number of interconnected components, whose main aim is to perform financial transactions of any kind. Its chief advantage lies in the fact that human intervention is minimized to an acceptable extent. This is quite desirable because nowadays numerous factors affect financial decisions. Financial managers are able to deal with a limited amount of information. There are many ways to implement algorithmic trading systems. This chapter aims to highlight the efficiency of biologically inspired methodol
APA, Harvard, Vancouver, ISO, and other styles
10

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Network growth algorithms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0008.

Full text
Abstract:
Growth processes are a fundamentally different approach compared to probability-driven exponential models covered in earlier chapters. This chapter studies how growth rules can be designed to mimic processes observed in the real world, and how the process can be mathematically analyzed in order to obtain information about the likely topological properties of the resulting networks. The configuration (stub joining) model is described, including a careful discussion of how bias can be introduced if backtracking is used instead of restarting if stubs join to form a self or double link. The second
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "NUMEROUS ALGORITHMS"

1

Mendy Nefale, Mpho, and Ritesh Ajoodha. "Using Numerous Biographical and Enrolling Observations to Predict Student Performance." In Algorithms for Intelligent Systems. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7041-2_55.

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

Kumar, Karanam Sunil, and N. P. Kavya. "Computational Contextual Framework for Dynamic Tracking of Numerous Mobile Object." In Data Science and Algorithms in Systems. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21438-7_63.

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

Dave, Jay. "An Optimised Robust Model for Big Data Security on the Cloud Environment: The Numerous User-Level Data Compaction." In Algorithms for Intelligent Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-4936-6_23.

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

Meyer, Ulrich, and Manuel Penschuck. "Generating Synthetic Graph Data from Random Network Models." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_2.

Full text
Abstract:
AbstractNetwork models are developed and used in various fields of science as their design and analysis can improve the understanding of the numerous complex systems we can observe on an everyday basis. From an algorithmics point of view, structural insights into networks can guide the engineering of tailor-made graph algorithms required to face the big data challenge.By design, network models describe graph classes and therefore can often provide meaningful synthetic instances whose applications include experimental case studies. While there exist public network libraries with numerous datasets, the available instances do not fully satisfy the needs of experimenters, especially pertaining to size and diversity. As several SPP 1736 projects engineered practical graph algorithms, multiple sampling algorithms for various graph models were designed and implemented to supplement experimental campaigns. In this chapter, we survey the results obtained for these so-called graph generators. This chapter is partially based on [43 SPP].
APA, Harvard, Vancouver, ISO, and other styles
5

Yoshida, Yuichi. "Constant-Time Algorithms for Continuous Optimization Problems." In Sublinear Computation Paradigm. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_3.

Full text
Abstract:
AbstractIn this chapter, we consider constant-time algorithms for continuous optimization problems. Specifically, we consider quadratic function minimization and tensor decomposition, both of which have numerous applications in machine learning and data mining. The key component in our analysis is graph limit theory, which was originally developed to study graphs analytically.
APA, Harvard, Vancouver, ISO, and other styles
6

Havlena, Vojtěch, Ondřej Lengál, Yong Li, Barbora Šmahlíková, and Andrea Turrini. "Modular Mix-and-Match Complementation of Büchi Automata." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_13.

Full text
Abstract:
AbstractComplementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis of programs, model checking, or in decision procedures of some logics. We build on ideas from a recent work on BA determinization by Li et al. and propose a new modular algorithm for BA complementation. Our algorithm allows to combine several BA complementation procedures together, with one procedure for a subset of the BA’s strongly connected components (SCCs). In this way, one can exploit the structure of particular SCCs (such as when they are inherently weak or deterministic) and use more efficient specialized algorithms, regardless of the structure of the whole BA. We give a general framework into which partial complementation procedures can be plugged in, and its instantiation with several algorithms. The framework can, in general, produce a complement with an Emerson-Lei acceptance condition, which can often be more compact. Using the algorithm, we were able to establish an exponentially better new upper bound of $$\mathcal {O}(4^n)$$ O ( 4 n ) for complementation of the recently introduced class of elevator automata. We implemented the algorithm in a prototype and performed a comprehensive set of experiments on a large set of benchmarks, showing that our framework complements well the state of the art and that it can serve as a basis for future efficient BA complementation and inclusion checking algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Cortes, João, Inês Lynce, and Vasco Manquinho. "New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_7.

Full text
Abstract:
Abstract In the last decade, numerous algorithms for single-objective Boolean optimization have been proposed that rely on the iterative usage of a highly effective Propositional Satisfiability (SAT) solver. But the use of SAT solvers in Multi-Objective Combinatorial Optimization (MOCO) algorithms is still scarce. Due to this shortage of efficient tools for MOCO, many real-world applications formulated as multi-objective are simplified to single-objective, using either a linear combination or a lexicographic ordering of the objective functions to optimize.In this paper, we extend the state of the art of MOCO solvers with two novel unsatisfiability-based algorithms. The first is a core-guided MOCO solver. The second is a hitting set-based MOCO solver. Experimental results in several sets of benchmark instances show that our new unsatisfiability-based algorithms can outperform state-of-the-art SAT-based algorithms for MOCO.
APA, Harvard, Vancouver, ISO, and other styles
8

Greiner-Petter, André, Howard S. Cohl, Abdou Youssef, et al. "Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_5.

Full text
Abstract:
AbstractDigital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research applications rely more and more on computational solutions, which are often calculated and verified by computer algebra systems. Hence, the correctness, accuracy, and reliability of both digital mathematical libraries and computer algebra systems is a crucial attribute for modern research. In this paper, we present a novel approach to verify a digital mathematical library and two computer algebra systems with one another by converting mathematical expressions from one system to the other. We use our previously developed conversion tool (referred to as "Image missing" ) to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems and . The contributions of our presented work are as follows: (1) we present the most comprehensive verification of computer algebra systems and digital mathematical libraries with one another; (2) we significantly enhance the performance of the underlying translator in terms of coverage and accuracy; and (3) we provide open access to translations for and of the formulae in the NIST Digital Library of Mathematical Functions.
APA, Harvard, Vancouver, ISO, and other styles
9

Tasneem, Rayeesa, and M. A. Jabbar. "An Insight into Load Balancing in Cloud Computing." In Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_113.

Full text
Abstract:
AbstractCloud Computing has emerged as a High-performance computing model providing on-demand computing resources as services via the Internet. Services include applications, storage, processing power, allocation of resources and many more. It is a pay-per-use model. Despite of providing various services, it is also experiencing numerous challenges like data security, optimized resource utilization, performance management, cost management, Cloud migration and many more. Among all, Load Balancing is another key challenge faced by Cloud. Effective load balancing mechanism will optimize the utilization of resources and improve the cloud performance. Load balancing is a mechanism to identify the overloaded and under loaded nodes and then balance the load by uniformly distributing the workload among the nodes. Various load balancing mechanisms are proposed by various researchers by taking different performance metrics. However existing load balancing algorithms are suffering from various drawbacks. This paper emphasizes the comparative review of various algorithms on Load Balancing along with their advantages, shortcomings and mathematical models.
APA, Harvard, Vancouver, ISO, and other styles
10

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. "Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis." In Programming Languages and Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_5.

Full text
Abstract:
AbstractInterprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries.In this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "NUMEROUS ALGORITHMS"

1

Saraswat, Shipra, Neetu Faujdar, and Sachin Sharma. "Comparative Examination of Fake News Recognition Using an Ensemble of Numerous Machine Learning Algorithms." In 2023 6th International Conference on Information Systems and Computer Networks (ISCON). IEEE, 2023. http://dx.doi.org/10.1109/iscon57294.2023.10111965.

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

Kwong, John Chris T., Felan Carlo C. Garcia, Patricia Angela R. Abu, and Rosula S. J. Reyes. "Emotion Recognition via Facial Expression: Utilization of Numerous Feature Descriptors in Different Machine Learning Algorithms." In TENCON 2018 - 2018 IEEE Region 10 Conference. IEEE, 2018. http://dx.doi.org/10.1109/tencon.2018.8650192.

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

Kanungo, T., M. Y. Jaisimha, J. Palmer, and R. M. Haralick. "Methodology for analyzing the performance of detection tasks." In OSA Annual Meeting. Optica Publishing Group, 1992. http://dx.doi.org/10.1364/oam.1992.fcc3.

Full text
Abstract:
There has been increasing interest in quantitative performance evaluation of computer vision algorithms. The usual method is to vary parameters of the input images or parameters of the algorithms and then construct operating curves that relate the probability of misdetection and false alarm for each parameter setting. Such an analysis does not integrate the performance of the numerous operating curves. In this paper we outline a methodology for summarizing many operating curves into a few performance curves. This methodology is adapted from the human psychophysics literature and is general to
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Yihan, Meikang Qiu, and Hongchang Gao. "Communication-Efficient Stochastic Gradient Descent Ascent with Momentum Algorithms." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/512.

Full text
Abstract:
Numerous machine learning models can be formulated as a stochastic minimax optimization problem, such as imbalanced data classification with AUC maximization. Developing efficient algorithms to optimize such kinds of problems is of importance and necessity. However, most existing algorithms restrict their focus on the single-machine setting so that they are incapable of dealing with the large communication overhead in a distributed training system. Moreover, most existing communication-efficient optimization algorithms only focus on the traditional minimization problem, failing to handle the m
APA, Harvard, Vancouver, ISO, and other styles
5

Shellshear, Evan, Johan S. Carlson, and Robert Bohlin. "A Combinatorial Packing Algorithm and Standard Trunk Geometry for ISO Luggage Packing." In 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.

Full text
Abstract:
Automated packing algorithms for luggage compartments in automobiles are of great interest. The difficulty of automatically computing the volume of a mesh representation of a boot according to the ISO 3832 standard restricts the design of vehicles required to meet minimal trunk volume specifications and also increases the cost of physical and virtual verification of the original design specifications. In our paper we present a new heuristic combinatorial packing algorithm for the ISO luggage packing standard. The algorithm presents numerous advantages over previous algorithms in terms of its s
APA, Harvard, Vancouver, ISO, and other styles
6

Gou, J. B., Y. X. Chu, and Z. X. Li. "A Geometric Theory for Form, Profile and Orientation Tolerances: Evaluation Algorithms and Simulation Results." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dfm-5744.

Full text
Abstract:
Abstract Using the geometric theory for formulation of form, profile and orientation tolerances, we develop a simple geometric algorithm, called the Symmetric Minimum Zone (SMZ) algorithm, to unify the computation of form, profile and orientation tolerances. First, using a technique of numerical analysis, we transform the non-differentiable minimization problem into a differentiable minimization problem over an extended configuration space. Then, we solve the latter problem by computing the solutions of a sequence of linear programming problems which can be easily derived using the geometric p
APA, Harvard, Vancouver, ISO, and other styles
7

Aslanides, John, Jan Leike, and Marcus Hutter. "Universal Reinforcement Learning Algorithms: Survey and Experiments." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/194.

Full text
Abstract:
Many state-of-the-art reinforcement learning (RL) algorithms typically assume that the environment is an ergodic Markov Decision Process (MDP). In contrast, the field of universal reinforcement learning (URL) is concerned with algorithms that make as few assumptions as possible about the environment. The universal Bayesian agent AIXI and a family of related URL algorithms have been developed in this setting. While numerous theoretical optimality results have been proven for these agents, there has been no empirical investigation of their behavior to date. We present a short and accessible surv
APA, Harvard, Vancouver, ISO, and other styles
8

West, A. C., and S. A. Sherif. "Optimization of Multistage Vapor Compression Systems Employing Genetic Algorithms." In 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.

Full text
Abstract:
Genetic algorithms involve the coding of a solution into a binary string in the same manner that DNA is a biological coding. A population of binary strings are randomly created, evaluated, allowed to mate, and mutated to form a new generation of strings. There is a mating preference given to those strings which rate the highest to simulate the survival of the fittest theory that exists in nature. This process of evaluation, mating, and mutation is repeated until some termination criteria are met. A computer code was written to simulate the vapor compression systems and perpetuate the genetic a
APA, Harvard, Vancouver, ISO, and other styles
9

Matsugu, Shohei, Yasuhiro Fujiwara, and Hiroaki Shiokawa. "Uncovering the Largest Community in Social Networks at Scale." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/250.

Full text
Abstract:
The Maximum k-Plex Search (MPS) can find the largest k-plex, which is a generalization of the largest clique. Although MPS is commonly used in AI to effectively discover real-world communities of social networks, existing MPS algorithms suffer from high computational costs because they iteratively scan numerous nodes to find the largest k-plex. Here, we present an efficient MPS algorithm called Branch-and-Merge (BnM), which outputs an exact maximum k-plex. BnM merges unnecessary nodes to explore a smaller graph than the original one. Extensive evaluations on real-world social networks demonstr
APA, Harvard, Vancouver, ISO, and other styles
10

Tian, Yinghui, and Mark J. Cassidy. "Explicit and Implicit Integration Algorithms for an Elastoplastic Pipe-Soil Interaction Macroelement Model." In ASME 2008 27th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2008. http://dx.doi.org/10.1115/omae2008-57237.

Full text
Abstract:
This paper presents the numerical formulation of an elastoplastic force-resultant model to numerically simulate the interaction of a pipe with the soil. This approach, which accounts for the load-displacement behaviour of the pipe-soil system on a macroelement level, is becoming increasingly popular in offshore engineering. The model consists of a yield surface, a non-associated flow rule, an isotropic hardening law and a description of purely elastic behaviour. It can be used to predict the behavior of one segment of pipe or numerous models can be attached to structural finite elements as nod
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "NUMEROUS ALGORITHMS"

1

Lorenz, Markus. Auswirkungen des Decoy-Effekts auf die Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850013.

Full text
Abstract:
Limitations in the human decision-making process restrict the technological potential of algorithms, which is also referred to as "algorithm aversion". This study uses a laboratory experiment with participants to investigate whether a phenomenon known since 1982 as the "decoy effect" is suitable for reducing algorithm aversion. For numerous analogue products, such as cars, drinks or newspaper subscriptions, the Decoy Effect is known to have a strong influence on human decision-making behaviour. Surprisingly, the decisions between forecasts by humans and Robo Advisors (algorithms) investigated
APA, Harvard, Vancouver, ISO, and other styles
2

Breton, 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.), 2022. http://dx.doi.org/10.21079/11681/42780.

Full text
Abstract:
Modeling the propagation of radiofrequency signals over irregular terrain is both challenging and critically important in numerous Army applications. One application of particular importance is the performance and radio connectivity of sensors deployed in scenarios where the terrain and the environment significantly impact signal propagation. This report investigates both the performance of and the algorithms and assumptions underlying the Delta-Bullington irregular terrain radiofrequency propagation model discussed in International Telecommunications Union Recommendation P.526-15. The aim is
APA, Harvard, Vancouver, ISO, and other styles
3

Grace, Dr Golla Reethi Shiny, Dr Anu K., Dr Pratyusha Choudary G., and Dr M. v. PATTERN OF THE HEMATOLOGICAL PARAMETERS IN COVID-19 PATIENTS. World Wide Journals, 2023. http://dx.doi.org/10.36106/ijar/5106302.

Full text
Abstract:
Background: The coronavirus (SARS CoV 2)-related viral disease COVID 19 causes acute respiratory disease with severe symptoms. Numerous biomarkers of infection and inammation have been found to inuence the severity of disease. Acute respiratory infection, fever, pneumonia, cough, tiredness, and inammation are frequent clinical ndings during hospitalisation. The severity of the disease and a possibility of disease progression can be determined by circulating biomarkers like TWBC count, NLR and CRP that reect inammation. This is a retrospective study conducted on eight Material and Methods
APA, Harvard, Vancouver, ISO, and other styles
4

Pound, B. G. GRI-99-0000 Gap Analysis of the GRI Research Program on Internal Corrosion. Pipeline Research Council International, Inc. (PRCI), 1999. http://dx.doi.org/10.55274/r0010720.

Full text
Abstract:
Extensive information on the corrosion of steel in aqueous CO2 systems is now available from this program and numerous other sources. This information was reviewed to identify what research has been performed and what research remains to be undertaken to develop a expert system/risk management program. Four areas were examined: corrosion mechanisms, mitigation strategies, monitoring techniques, and models/risk assessment. There were five gaps in mechanisms (two for bacteria and one each for flow rate/chloride concentration, hydrocarbons, and organic acids) and four gaps in mitigation (antibiof
APA, Harvard, Vancouver, ISO, and other styles
5

Saltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42240.

Full text
Abstract:
Monitoring water quality of small inland lakes and reservoirs is a critical component of USACE water quality management plans. However, limited resources for traditional field-based monitoring of numerous lakes and reservoirs that cover vast geographic areas often leads to reactional responses to harmful algal bloom (HAB) outbreaks. Satellite remote sensing methodologies using HAB indicators is a good low-cost option to traditional methods and has been proven to maximize and complement current field-based approaches while providing a synoptic view of water quality (Beck et al. 2016; Beck et al
APA, Harvard, Vancouver, ISO, and other styles
6

Saltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox : user's guide. Engineer Research and Development Center (U.S.), 2022. http://dx.doi.org/10.21079/11681/45362.

Full text
Abstract:
Monitoring water quality of small inland lakes and reservoirs is a critical component of the US Army Corps of Engineers (USACE) water quality management plans. However, limited resources for traditional field-based monitoring of numerous lakes and reservoirs covering vast geographic areas often leads to reactional responses to harmful algal bloom (HAB) outbreaks. Satellite remote sensing methodologies using HAB indicators is a good low-cost option to traditional methods and has been proven to maximize and complement current field-based approaches while providing a synoptic view of water qualit
APA, Harvard, Vancouver, ISO, and other styles
7

Bourdeau, J. E., and 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.

Full text
Abstract:
Regional-scale lake sediment surveys have been successfully used since the 1970s as a means for reconnaissance geochemical exploration. Lake sediment sampling is typically performed in areas with a lack of streams and an overabundance of small-sized (=5 km across) lakes. Lake sediments are known to have major, minor and trace element concentrations that reflect the local geology. Overall, lake sediment surveys are planned and conducted following four distinct stages: 1) background research, 2) orientation survey, 3) regional survey, and 4) detailed survey. At the Geological Survey of Canada, s
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Yongping, Wen Cheng, and Xudong Jia. Enhancement of Multimodal Traffic Safety in High-Quality Transit Areas. Mineta Transportation Institute, 2021. http://dx.doi.org/10.31979/mti.2021.1920.

Full text
Abstract:
Numerous extant studies are dedicated to enhancing the safety of active transportation modes, but very few studies are devoted to safety analysis surrounding transit stations, which serve as an important modal interface for pedestrians and bicyclists. This study bridges the gap by developing joint models based on the multivariate conditionally autoregressive (MCAR) priors with a distance-oriented neighboring weight matrix. For this purpose, transit-station-centered data in Los Angeles County were used for model development. Feature selection relying on both random forest and correlation analys
APA, Harvard, Vancouver, ISO, and other styles
9

Fourie and Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Pipeline Research Council International, Inc. (PRCI), 2002. http://dx.doi.org/10.55274/r0010624.

Full text
Abstract:
It is accepted that many situations exist on pipelines where a significant length of the pipeline (typically 2000 ft to 5 miles) is either totally inaccessible or access is so difficult or expensive that monitoring is not done at the required frequency. The need for finding a technique to allow the corrosion engineer to monitor CP levels of inaccessible locations from an accessible remote location has therefore been identified. A study to investigate all possible techniques available to achieve the above objective and to analyze typical scenarios requiring this approach has therefore been unde
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography