Thematische Bibliographien / Algorithms

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Algorithms“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Algorithms" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Algorithms"

Sun, Yuqin, Songlei Wang, Dongmei Huang, Yuan Sun, Anduo Hu, and Jinzhong Sun. "A multiple hierarchical clustering ensemble algorithm to recognize clusters arbitrarily shaped." Intelligent Data Analysis 26, no. 5 (2022): 1211–28. http://dx.doi.org/10.3233/ida-216112.

Der volle Inhalt der Quelle

Annotation:

As a research hotspot in ensemble learning, clustering ensemble obtains robust and highly accurate algorithms by integrating multiple basic clustering algorithms. Most of the existing clustering ensemble algorithms take the linear clustering algorithms as the base clusterings. As a typical unsupervised learning technique, clustering algorithms have difficulties properly defining the accuracy of the findings, making it difficult to significantly enhance the performance of the final algorithm. AGglomerative NESting method is used to build base clusters in this article, and an integration strateg

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Moret, Bernard M. E., and Henry D. D. Shapiro. "Algorithms and Experiments: The New (and Old) Methodology." JUCS - Journal of Universal Computer Science 7, no. (5) (2001): 434–46. https://doi.org/10.3217/jucs-007-05-0434.

Der volle Inhalt der Quelle

Annotation:

The last twenty years have seen enormous progress in the design of algorithms, but little of it has been put into practice. Because many recently developed algorithms are hard to characterize theoretically and have large running_time coefficients, the gap between theory and practice has widened over these years. Experimentation is indispensable in the assessment of heuristics for hard problems, in the characterization of asymptotic behavior of complex algorithms, and in the comparison of competing designs for tractable problems. Implementation, although perhaps not rigorous experimentation, wa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gościniak, Ireneusz, and Krzysztof Gdawiec. "Visual Analysis of Dynamics Behaviour of an Iterative Method Depending on Selected Parameters and Modifications." Entropy 22, no. 7 (2020): 734. http://dx.doi.org/10.3390/e22070734.

Der volle Inhalt der Quelle

Annotation:

There is a huge group of algorithms described in the literature that iteratively find solutions of a given equation. Most of them require tuning. The article presents root-finding algorithms that are based on the Newton–Raphson method which iteratively finds the solutions, and require tuning. The modification of the algorithm implements the best position of particle similarly to the particle swarm optimisation algorithms. The proposed approach allows visualising the impact of the algorithm’s elements on the complex behaviour of the algorithm. Moreover, instead of the standard Picard iteration,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nico, Nico, Novrido Charibaldi, and Yuli Fauziah. "Comparison of Memetic Algorithm and Genetic Algorithm on Nurse Picket Scheduling at Public Health Center." International Journal of Artificial Intelligence & Robotics (IJAIR) 4, no. 1 (2022): 9–23. http://dx.doi.org/10.25139/ijair.v4i1.4323.

Der volle Inhalt der Quelle

Annotation:

 One of the most significant aspects of the working world is the concept of a picket schedule. It is difficult for the scheduler to make an archive since there are frequently many issues with the picket schedule. These issues include schedule clashes, requests for leave, and trading schedules. Evolutionary algorithms have been successful in solving a wide variety of scheduling issues. Evolutionary algorithms are very susceptible to data convergence. But no one has discussed where to start from, where the data converges from making schedules using evolutionary algorithms. The best algorit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Omar, Hoger K., Kamal H. Jihad, and Shalau F. Hussein. "Comparative analysis of the essential CPU scheduling algorithms." Bulletin of Electrical Engineering and Informatics 10, no. 5 (2021): 2742–50. http://dx.doi.org/10.11591/eei.v10i5.2812.

Der volle Inhalt der Quelle

Annotation:

CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state. As well as, CPU scheduling algorithms are the main service in the operating systems that fulfill the maximum utilization of the CPU. This paper aims to compare the characteristics of the CPU scheduling algorithms towards which one is the best algorithm for gaining a higher CPU utilization. The comparison has been done between ten scheduling algorithms with present

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hairol Anuar, Siti Haryanti, Zuraida Abal Abas, Norhazwani Mohd Yunos, et al. "Comparison between Louvain and Leiden Algorithm for Network Structure: A Review." Journal of Physics: Conference Series 2129, no. 1 (2021): 012028. http://dx.doi.org/10.1088/1742-6596/2129/1/012028.

Der volle Inhalt der Quelle

Annotation:

Abstract In the real network, there must be a large and complex network. The solution to understand that kind of network structure is using the community detection algorithms. There are a lot of other algorithms out there to perform community detection. Each of the algorithms has its own advantages and disadvantages with different types and scale of complex network. The Louvain has been experimented that shows bad connected in community and disconnected when running the algorithm iteratively. In this paper, two algorithm based on agglomerative method (Louvain and Leiden) are introduced and rev

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gangavane, Ms H. N. "A Comparison of ABK-Means Algorithm with Traditional Algorithms." International Journal of Trend in Scientific Research and Development Volume-1, Issue-4 (2017): 614–21. http://dx.doi.org/10.31142/ijtsrd2197.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jay, Kishore Sahani, and Kumar Yadav Arvind. "The Bees Algorithms in Optimization: An Overview." MATHEMATICS EDUCATION LV, no. 3, September 2021 (2021): 20–28. https://doi.org/10.5281/zenodo.7275730.

Der volle Inhalt der Quelle

Annotation:

            Metaheuristic algorithms have become powerful tools for modeling and optimization. In this article, we provide an overview of Bee Algorithms and their applications. We will briefly introduce algorithms such as bee algorithms, virtual bee algorithm, artificial bee algorithm, bee mating algorithm, etc. We also briefly the main characteristics of these algorithms and outline some recent applications of these algorithms. 

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Belazi, Akram, Héctor Migallón, Daniel Gónzalez-Sánchez, Jorge Gónzalez-García, Antonio Jimeno-Morenilla, and José-Luis Sánchez-Romero. "Enhanced Parallel Sine Cosine Algorithm for Constrained and Unconstrained Optimization." Mathematics 10, no. 7 (2022): 1166. http://dx.doi.org/10.3390/math10071166.

Der volle Inhalt der Quelle

Annotation:

The sine cosine algorithm’s main idea is the sine and cosine-based vacillation outwards or towards the best solution. The first main contribution of this paper proposes an enhanced version of the SCA algorithm called as ESCA algorithm. The supremacy of the proposed algorithm over a set of state-of-the-art algorithms in terms of solution accuracy and convergence speed will be demonstrated by experimental tests. When these algorithms are transferred to the business sector, they must meet time requirements dependent on the industrial process. If these temporal requirements are not met, an efficie

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Luan, Yuxuan, Junjiang He, Jingmin Yang, Xiaolong Lan, and Geying Yang. "Uniformity-Comprehensive Multiobjective Optimization Evolutionary Algorithm Based on Machine Learning." International Journal of Intelligent Systems 2023 (November 10, 2023): 1–21. http://dx.doi.org/10.1155/2023/1666735.

Der volle Inhalt der Quelle

Annotation:

When solving real-world optimization problems, the uniformity of Pareto fronts is an essential strategy in multiobjective optimization problems (MOPs). However, it is a common challenge for many existing multiobjective optimization algorithms due to the skewed distribution of solutions and biases towards specific objective functions. This paper proposes a uniformity-comprehensive multiobjective optimization evolutionary algorithm based on machine learning to address this limitation. Our algorithm utilizes uniform initialization and self-organizing map (SOM) to enhance population diversity and

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Algorithms"

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Crocomo, Márcio Kassouf. "Algoritmo de otimização bayesiano com detecção de comunidades." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-23012013-160605/.

Der volle Inhalt der Quelle

Annotation:

ALGORITMOS de Estimação de Distribuição (EDAs) compõem uma frente de pesquisa em Computação Evolutiva que tem apresentado resultados promissores para lidar com problemas complexos de larga escala. Nesse contexto, destaca-se o Algoritmo de Otimização Bayesiano (BOA) que usa um modelo probabilístico multivariado (representado por uma rede Bayesiana) para gerar novas soluções a cada iteração. Baseado no BOA e na investigação de algoritmos de detecção de estrutura de comunidades (para melhorar os modelos multivariados construídos), propõe-se dois novos algoritmos denominados CD-BOA e StrOp. Mostra

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Davidsdottir, Agnes. "Algorithms, Turing machines and algorithmic undecidability." Thesis, Uppsala universitet, Algebra och geometri, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441282.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tikhonenko, Dmitrii. "Managing algorithmic drivers in a blocked-lane scenario." Doctoral thesis, Universitat Pompeu Fabra, 2020. http://hdl.handle.net/10803/670829.

Der volle Inhalt der Quelle

Annotation:

Due to the emergence of new technologies, algorithm-assisted drivers are close to becoming a reality. In this thesis, different aspects of managing such drivers in a blocked-lane scenario are discussed. The first chapter presents an algorithm for the optimal merging of self-interested drivers. The optimal policy can include undesirable velocity oscillations. We propose measures for a central planner to eradicate them, and we test the efficiency of our algorithm versus popular heuristic policies. In the second chapter, a mechanism for positional bidding of the drivers is developed. It al

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aguiar, Marilton Sanchotene de. "Análise formal da complexidade de algoritmos genéticos." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1998. http://hdl.handle.net/10183/25941.

Der volle Inhalt der Quelle

Annotation:

O objetivo do trabalho é estudar a viabilidade de tratar problemas de otimização, considerados intratáveis, através de Algoritmos Genéticos, desenvolvendo critérios para a avaliação qualitativa de um Algoritmo Genético. Dentro deste tema, abordam-se estudos sobre complexidade, classes de problemas, análise e desenvolvimento de algoritmos e Algoritmos Genéticos, este ultimo sendo objeto central do estudo. Como produto do estudo deste tema, é proposto um método de desenvolvimento de Algoritmos Genéticos, utilizando todo o estudo formal de tipos de problemas, desenvolvimento de algoritmos aproxim

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Quan Ph D. Massachusetts Institute of Technology. "Algorithms and algorithmic obstacles for probabilistic combinatorial structures." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115765.

Der volle Inhalt der Quelle

Annotation:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 209-214).<br>We study efficient average-case (approximation) algorithms for combinatorial optimization problems, as well as explore the algorithmic obstacles for a variety of discrete optimization problems arising in the theory of random graphs, statistics and machine learning. In particular, we consider the average-case optimization for three NP-hard combinatorial optimization problems: La

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Astete, morales Sandra. "Contributions to Convergence Analysis of Noisy Optimization Algorithms." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS327/document.

Der volle Inhalt der Quelle

Annotation:

Cette thèse montre des contributions à l'analyse d'algorithmes pour l'optimisation de fonctions bruitées. Les taux de convergences (regret simple et regret cumulatif) sont analysés pour les algorithmes de recherche linéaire ainsi que pour les algorithmes de recherche aléatoires. Nous prouvons que les algorithmes basé sur la matrice hessienne peuvent atteindre le même résultat que certaines algorithmes optimaux, lorsque les paramètres sont bien choisis. De plus, nous analysons l'ordre de convergence des stratégies évolutionnistes pour des fonctions bruitées. Nous déduisons une convergence log-l

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Algorithms"

Smith, Jeffrey Dean. Design and analysis of algorithms. PWS-KENT Pub. Co., 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

H, Jamieson Leah, Gannon Dennis B. 1947-, and Douglass Robert J, eds. The characteristics of parallel algorithms. MIT Press, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chang, Lin, William D. Chey, John Kellow, Jan Tack, and William E. Whitehead, eds. Rome IV Diagnostic Algorithms. The Rome Foundation, 2016. http://dx.doi.org/10.24890/algorithms.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Müller-Hannemann, Matthias, and Stefan Schirra. Algorithm engineering: Bridging the gap between algorithm theory and practice. Springer, 2010.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ebers, Martin, and Marta Cantero Gamito, eds. Algorithmic Governance and Governance of Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-50559-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Brent, R. P. Algorithms for minimization without derivatives. Dover Publications, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wilf, Herbert S. Algorithms and complexity. Prentice-Hall, 1986.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Asano, Tetsuo, Toshihide Ibaraki, Hiroshi Imai, and Takao Nishizeki, eds. Algorithms. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52921-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Algorithms"

Koska, Christopher. "Algorithm, Algorithmisation, Algorithmics." In Ethics of Algorithms. Springer Berlin Heidelberg, 2025. https://doi.org/10.1007/978-3-662-71518-5_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Taillard, Éric D. "Elements of Graphs and Complexity Theory." In Design of Heuristic Algorithms for Hard Optimization. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13714-3_1.

Der volle Inhalt der Quelle

Annotation:

AbstractThis chapter recalls some elements and definitions in graph theory and complexity theory. On the one hand, basic algorithmic courses very often include graph algorithms. Some of these algorithms have simply been transposed to solve difficult optimization problems in a heuristic way. On the other hand, it is important to be able to determine whether a problem falls into the category of difficult problems. Indeed, one will not develop a heuristic algorithm if there is an efficient algorithm to find an exact solution. Another objective of this chapter is to make the book self-contained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lalov, Boyan. "Algorithms Creating Algorithms." In Artificial Neural Networks – ICANN 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15825-4_39.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Leiserson, Charles E. "Algorithmic analysis of multithreaded algorithms." In Algorithms and Computation. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63890-3_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Algorithms and humans." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Theorizing complimentary abstractions." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Algorithms and subjects." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Algorithms as relational from the beginning." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Algorithms and data." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matzner, Tobias. "Algorithms and material conditions." In Algorithms. Routledge, 2023. http://dx.doi.org/10.4324/9781003299851-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Algorithms"

Anjum, Ishraq Md, Davorin Peceli, Francesco Capuano, and Bedrich Rus. "High-Power Laser Pulse Shape Optimization with Hybrid Stochastic Optimization Algorithms." In Frontiers in Optics. Optica Publishing Group, 2024. https://doi.org/10.1364/fio.2024.jd4a.55.

Der volle Inhalt der Quelle

Annotation:

We evaluate five optimization algorithms for laser pulse temporal shape optimization, using a semi-physical model of a high-power laser. Hybrid algorithms combine Differential Evolution and Bayesian optimization algorithm exploration with Nelder-Mead exploitation, exhibiting superior performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kardasz, Piotr, Krzysztof Kolebski, and Piotr Jednaszewski. "UTILIZING ALGORITHMS FOR IMAGING MEDICAL RESULTS FROM CT, MRI, AND PET INTO VIRTUAL REALITY." In 24th SGEM International Multidisciplinary Scientific GeoConference 2024. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/2.1/s07.12.

Der volle Inhalt der Quelle

Annotation:

Utilizing algorithms for imaging medical results from CT, MRI, and PET into Virtual Reality. There is a growing interest in the field of medical imaging in understanding the impact of algorithm parameters on the quality and interpretability of the obtained images. In the developed software VRMed3D aimed at educating students using medical images in virtual reality technology, Gaussian noise was utilized to identify the most effective edge detection algorithms. The search was for an algorithm that provided the most optimal quality of generated images while maintaining the shortest possible wait

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sambasivan, Lokesh Kumar, Joydeb Mukherjee, and Dinkar Mylaraswamy. "Benchmarking Diagnostic Algorithms." In ASME Turbo Expo 2007: Power for Land, Sea, and Air. ASMEDC, 2007. http://dx.doi.org/10.1115/gt2007-28194.

Der volle Inhalt der Quelle

Annotation:

The problem of fault diagnosis has gained considerable significance in a cost conscious aerospace industry. This has resulted in the development of novel methods as well as novel approaches. Following a cost benefit analysis, wherein a diagnostic algorithm has to buy its way on an aircraft, the practitioner is faced with the difficult problem of choosing the best algorithm from among many candidates. Despite the appeal of multiple algorithm solutions, practical applications are limited by engineering resources—the practitioner is forced to pick few among many. Specifically, this paper addresse

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Perju, Veaceslav, and Dorian Saranciuc. "Evaluation of the Multi-Algorithms Targets Recognition Systems." In 12th International Conference on Electronics, Communications and Computing. Technical University of Moldova, 2022. http://dx.doi.org/10.52326/ic-ecco.2022/cs.05.

Der volle Inhalt der Quelle

Annotation:

This paper presents the evaluation’s results of the new classes of the target recognition systems – multi- algorithms unimodal systems and multi-algorithms multimodal systems. The structures and the graphs of the systems are described. The mathematical descriptions and the formulas for evaluation of the system’s costs depending on the algorithm’s recognition probability and the relation between the costs of the algorithm’s software and the system’s hardware are presented. The approach to determine the cost of a system for an established threshold level of the system's recognition probability i

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kunz, Philipp, Ilche Georgievski, and Marco Aiello. "Towards a Framework for Learning of Algorithms: The Case of Learned Comparison Sorts." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/481.

Der volle Inhalt der Quelle

Annotation:

Designing algorithms is cumbersome and error-prone. This, among other things, has increasingly led to efforts to extend or even replace designing algorithms with machine learning models. While previous research has demonstrated that some machine learning models possess Turing-completeness, the findings are largely theoretical, and solutions for specific algorithmic tasks remain unclear. With this in mind, we investigate the feasibility of learning representations of classical algorithms from data on their execution, enabling their application to different inputs. We propose a novel and general

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Badi, Manjulata, Sheila Mahapatra, and Saurav Raj. "A SOLUTION OF RPM FOR ACTIVE AND REACTIVE LOADING COMPENSATION." In TOPICS IN INTELLIGENT COMPUTING AND INDUSTRY DESIGN (ICID). Volkson Press, 2022. http://dx.doi.org/10.26480/icpesd.02.2022.135.140.

Der volle Inhalt der Quelle

Annotation:

A solution for Reactive Power Management considering both the active and reactive power loading is obtained by Butterfly Optimization Algorithm (BOA) hybridized to form of Butterfly Optimization Algorithm-Grey Wolf Optimization (BOA-GWO) algorithms. The objective of the research is to optimize the operating cost and power loss for optimum reactive power solution with the proposed combined algorithm and a comparative account with other algorithms depicts the proposed algorithm’s superiority. In view of best result obtained for real power cost reduction is 3.5% and percentage loss as 3.493% with

APA, Harvard, Vancouver, ISO und andere Zitierweisen

McCormick, N. J., and Z. Tao. "Algorithms for bioluminescence estimation." In OSA Annual Meeting. Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.thff3.

Der volle Inhalt der Quelle

Annotation:

Two algorithms are compared for estimating the spatial dependence of bioluminescence using in situ measurements of the irradiance and scalar irradiance. The conservation algorithm is based on the conservation principle of radiative transfer, but it requires a separate estimation of the difficult-to-measure absorption coefficient; the two-stream algorithm incorporates additional equations to estimate the absorption coefficient and the albedo of single scattering. The algorithms have been numerically tested with fluctuations in measurements simulated with a random sampling approach. The effectiv

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Caizergues, Emma, François Durand, and Fabien Mathieu. "Anytime Sorting Algorithms." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/785.

Der volle Inhalt der Quelle

Annotation:

This paper addresses the anytime sorting problem, aiming to develop algorithms providing tentative estimates of the sorted list at each execution step. Comparisons are treated as steps, and the Spearman's footrule metric evaluates estimation accuracy. We propose a general approach for making any sorting algorithm anytime and introduce two new algorithms: multizip sort and Corsort. Simulations showcase the superior performance of both algorithms compared to existing methods. Multizip sort keeps a low global complexity, while Corsort produces intermediate estimates surpassing previous algorithms

APA, Harvard, Vancouver, ISO und andere Zitierweisen

AbuKwaik, Mohammad, Yousef Sardahi, and Ahmad M. Alshorman. "Optimizing Control Systems: A Comparative Analysis of 77 Multi-Objective Evolutionary Algorithms." In ASME 2024 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2024. https://doi.org/10.1115/imece2024-140634.

Der volle Inhalt der Quelle

Annotation:

Abstract Multi-objective optimization is integral to control systems, particularly in engineering, where multiple objectives must be concurrently satisfied. This study pioneers a comprehensive comparison of 77 evolutionary algorithms for optimizing a second-order system under a proportional-integral-derivative (PID) controller. We emphasize the challenges of balancing conflicting metrics like peak time and percentage overshoot and how PID controller tuning is crucial in achieving this balance. To assess the algorithms’ performance, we utilize four different performance metrics, which encompass

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fadhil, Heba. "Metaheuristic Algorithms in Optimization and its Application: A Review." In The 3rd International Conference On Engineering And Innovative Technology. Salahaddin University-Erbil, 2025. https://doi.org/10.31972/iceit2024.013.

Der volle Inhalt der Quelle

Annotation:

Metaheuristic algorithms are an intelligent way of thinking and working developed for resolving diverse issues about optimization. The number of potential solutions for such problems often is too large to be properly analyzed using standard procedures; thus, these algorithms are highly flexible and can be useful in many cases where needed to predict different types of optimizations accurately. Metaheuristics take inspiration from several natural processes like evolution or animal behavior, which allow them to show strength without being specific only towards one area. Some Metaheuristics algor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Algorithms"

Marty, Frédéric, and Thierry Warin. Deciphering Algorithmic Collusion: Insights from Bandit Algorithms and Implications for Antitrust Enforcement. CIRANO, 2023. http://dx.doi.org/10.54932/iwpg7510.

Der volle Inhalt der Quelle

Annotation:

This paper examines algorithmic collusion from legal and economic perspectives, highlighting the growing role of algorithms in digital markets and their potential for anti-competitive behavior. Using bandit algorithms as a model, traditionally applied in uncertain decision-making contexts, we illuminate the dynamics of implicit collusion without overt communication. Legally, the challenge is discerning and classifying these algorithmic signals, especially as unilateral communications. Economically, distinguishing between rational pricing and collusive patterns becomes intricate with algorithm-

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tipton, Kelley, Brian F. Leas, Emilia Flores, et al. Impact of Healthcare Algorithms on Racial and Ethnic Disparities in Health and Healthcare. Agency for Healthcare Research and Quality (AHRQ), 2023. http://dx.doi.org/10.23970/ahrqepccer268.

Der volle Inhalt der Quelle

Annotation:

Objectives. To examine the evidence on whether and how healthcare algorithms (including algorithm-informed decision tools) exacerbate, perpetuate, or reduce racial and ethnic disparities in access to healthcare, quality of care, and health outcomes, and examine strategies that mitigate racial and ethnic bias in the development and use of algorithms. Data sources. We searched published and grey literature for relevant studies published between January 2011 and February 2023. Based on expert guidance, we determined that earlier articles are unlikely to reflect current algorithms. We also hand-se

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Johansen, Richard A., Christina L. Saltus, Molly K. Reif, and Kaytee L. Pokrzywinski. A Review of Empirical Algorithms for the Detection and Quantification of Harmful Algal Blooms Using Satellite-Borne Remote Sensing. U.S. Army Engineer Research and Development Center, 2022. http://dx.doi.org/10.21079/11681/44523.

Der volle Inhalt der Quelle

Annotation:

Harmful Algal Blooms (HABs) continue to be a global concern, especially since predicting bloom events including the intensity, extent, and geographic location, remain difficult. However, remote sensing platforms are useful tools for monitoring HABs across space and time. The main objective of this review was to explore the scientific literature to develop a near-comprehensive list of spectrally derived empirical algorithms for satellite imagers commonly utilized for the detection and quantification HABs and water quality indicators. This review identified the 29 WorldView-2 MSI algorithms, 25

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, and Rafael Peñaloza. Axiom Pinpointing in General Tableaux. Aachen University of Technology, 2007. http://dx.doi.org/10.25368/2022.159.

Der volle Inhalt der Quelle

Annotation:

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a partic

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, and Rafael Peñaloza. Pinpointing in Terminating Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.166.

Der volle Inhalt der Quelle

Annotation:

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Arthur, Jennifer Ann. Genetic Algorithms. Office of Scientific and Technical Information (OSTI), 2017. http://dx.doi.org/10.2172/1375151.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sahni, Sartaj. Parallel Algorithms. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada369856.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vazirani, Umesh. Quantum Algorithms. Defense Technical Information Center, 2013. http://dx.doi.org/10.21236/ada579025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, and Rafael Peñaloza. Blocking and Pinpointing in Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.165.

Der volle Inhalt der Quelle

Annotation:

Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in consideration. Several pinpointing algorithms have been described as extensions of the standard tableau-based reasoning algorithms for deciding consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL, using specific traits of them. In the past, we have developed a genera

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cordeiro de Amorim, Renato. A survey on feature weighting based K-Means algorithms. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.79.

Der volle Inhalt der Quelle

Annotation:

In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algo

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!