Relevant bibliographies by topics / Algorithems

Contents

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

Academic literature on the topic 'Algorithems'

Author: Grafiati
Published: 6 September 2023
Last updated: 31 July 2025

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 'Algorithems.'

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 "Algorithems"

1

Tian, Xin Cheng, and Xiao Hong Deng. "Trajectory Interpolation in CNC Grinding of Indexable Inserts." Advanced Materials Research 97-101 (March 2010): 2007–10. http://dx.doi.org/10.4028/www.scientific.net/amr.97-101.2007.

Full text
Abstract:
Most of the commenly adotped interpolation algorithems are for the curve machining on CNC machine tools with Cartesian coordinates configuration. For a CNC machine tool with non-Cartesian configuration, new trajectory interpolation algorithem must be developed to machine complex part sueface. Based on the analysis of the geometric characteristics and the CNC grinding principle of indexable inserts, this paper proposes two interpolation algorithems to grind the nose surface of indexable inserts with constant or variable back angle. The algorithm precision analysis is also made in this paper.
APA, Harvard, Vancouver, ISO, and other styles
2

Morsy, H., M. El-khatib, W. Hussein, and M. Mahgoub. "INVESTIGATION OF MODERN CONTROL ALGORITHEMS IN MECHATRONIC SYSTEM." International Conference on Applied Mechanics and Mechanical Engineering 15, no. 15 (2012): 1–20. http://dx.doi.org/10.21608/amme.2012.37057.

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

Ye, Jun. "Applying Immune Algorithems to the Calculation of Sound Insulation of Walls." Applied Mechanics and Materials 584-586 (July 2014): 1853–57. http://dx.doi.org/10.4028/www.scientific.net/amm.584-586.1853.

Full text
Abstract:
Building wall plays a key role in the noise isolation. As a there are lot of open holes in the wall for various construction equipments, pipes and lines, it is an important issue how to determine the maximum area of wall cracks with the given expect sound insulation. The calculation model is established with immune algorithm, the expected value of the sound isolation is defined as objective function, the areal density, thickness and Young modulus of monolayer wall are defined as bounded variable. The global maximum value of objective function is obtained by the MATLAB program and so to determi
APA, Harvard, Vancouver, ISO, and other styles
4

Murtuza, Syed. "A Concis Presentation of Supiervised Learing Algorithems for Feedforward Neural Netwoks." IFAC Proceedings Volumes 27, no. 9 (1994): 91–94. http://dx.doi.org/10.1016/s1474-6670(17)45902-7.

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

LIU, Yanfang. "Application of integration algorithems for elasto-plasticity constitutive model for anisotropic sheet materials." Chinese Journal of Mechanical Engineering (English Edition) 19, no. 04 (2006): 554. http://dx.doi.org/10.3901/cjme.2006.04.554.

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

Duvvada, Rajeswara Rao, Shaik Ayesha Fathima, and Shaik Noorjahan. "A Comprehensive Analysis and Design of Land Cover Usage from Satellite Images using Machine Learning Algorithems." Journal of Visual Language and Computing 2022, no. 1 (2022): 25–35. http://dx.doi.org/10.18293/jvlc2022-n1-014.

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

Devi, Kapila, and Saroj Ratnoo. "Cluster analysis of socio-economic factors and academic performance of school students." Indonesian Journal of Electrical Engineering and Computer Science 31, no. 3 (2023): 1568. http://dx.doi.org/10.11591/ijeecs.v31.i3.pp1568-1577.

Full text
Abstract:
The objective of the paper is to examine the academic performance of students’ vis-a-vis socio-economic factors using clustering analysis. The grades obtained in the 10<sup>th</sup> class are taken as the measure of academic performance. The variables such gender, caste, parental education and occupation. are considered as the socio-economic indicators. Three clustering algorithems are employed. The K-medoid performs better in the validation process to form the groupings based on intra-cluster homogeneity and inter-cluster heterogeneity. The clustering analysis results in two inter
APA, Harvard, Vancouver, ISO, and other styles
8

Kanwal, Fouzia, Mr Kamran Abid, Muhammad Sajid Maqbool, Dr Naeem Aslam, and Muhammad Fuzail. "Optimized Classification of Cardiovascular Disease Using Machine Learning Paradigms." VFAST Transactions on Software Engineering 11, no. 2 (2023): 140–48. http://dx.doi.org/10.21015/vtse.v11i2.1527.

Full text
Abstract:
Nearly 19 million people die each year from cardiovascular and chronic respiratory diseases, which are a global threat. It is necessary to address the causes of these diseases because of the high death rate. The investigation uncovered a number of causes, but the inability to forecast these diseases symptoms is by far the most significant. In this work, we developed a method for anticipating these diseases crucial symptoms, which will aid in early disease diagnosis and allow patients to begin treatment. This research will introduce a new computational medicine research using machine learning (
APA, Harvard, Vancouver, ISO, and other styles
9

Kapila, Devi, and Ratnoo Saroj. "Cluster analysis of socio-economic factors and academic performance of school students." Cluster analysis of socio-economic factors and academic performance of school students 31, no. 3 (2023): 1568–77. https://doi.org/10.11591/ijeecs.v31.i3.pp1568-1577.

Full text
Abstract:
The objective of the paper is to examine the academic performance of students’ vis-a-vis socio-economic factors using clustering analysis. The grades obtained in the 10th class are taken as the measure of academic performance the variables such gender, caste, parental education and occupation are considered as the socio-economic indicators. Three clustering algorithems are employed. The K-medoid performs better in the validation process to form the groupings based on intra-cluster homogeneity and intercluster heterogeneity. The clustering analysis results in two interesting groups of the
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorithems"

1

Gauthier, Morgan. "Déploiement haut niveau d'applications automobiles sur les architectures E/E futures." Electronic Thesis or Diss., Toulouse, ISAE, 2024. http://www.theses.fr/2024ESAE0037.

Full text
Abstract:
Cette thèse aborde les défis liés à la conception des futures architectures électriques/électroniques automobiles, en se concentrant particulièrement sur l’estimation des ressources de calcul au cours des premières phases de conception. L’étude passe en revue l’évolution historique des architectures E/E, soulignant la complexité croissante et les limites des systèmes décentralisés traditionnelsau cours de l’évolution de l’industrie automobile. L’énoncé du problème souligne la nécessité d’une estimation précise des ressources informatiques au début du processus de conception, en particulier dan
APA, Harvard, Vancouver, ISO, and other styles
2

Saadane, Sofiane. "Algorithmes stochastiques pour l'apprentissage, l'optimisation et l'approximation du régime stationnaire." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30203/document.

Full text
Abstract:
Dans cette thèse, nous étudions des thématiques autour des algorithmes stochastiques et c'est pour cette raison que nous débuterons ce manuscrit par des éléments généraux sur ces algorithmes en donnant des résultats historiques pour poser les bases de nos travaux. Ensuite, nous étudierons un algorithme de bandit issu des travaux de N arendra et Shapiro dont l'objectif est de déterminer parmi un choix de plusieurs sources laquelle profite le plus à l'utilisateur en évitant toutefois de passer trop de temps à tester celles qui sont moins per­formantes. Notre but est dans un premier temps de comp
APA, Harvard, Vancouver, ISO, and other styles
3

Corbineau, Marie-Caroline. "Proximal and interior point optimization strategies in image recovery." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC085/document.

Full text
Abstract:
Les problèmes inverses en traitement d'images peuvent être résolus en utilisant des méthodes variationnelles classiques, des approches basées sur l'apprentissage profond, ou encore des stratégies bayésiennes. Bien que différentes, ces approches nécessitent toutes des algorithmes d'optimisation efficaces. L'opérateur proximal est un outil important pour la minimisation de fonctions non lisses. Dans cette thèse, nous illustrons la polyvalence des algorithmes proximaux en les introduisant dans chacune des trois méthodes de résolution susmentionnées.Tout d'abord, nous considérons une formulation v
APA, Harvard, Vancouver, ISO, and other styles
4

Harris, Steven C. "A genetic algorithm for robust simulation optimization." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178645751.

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

Alkindy, Bassam. "Combining approaches for predicting genomic evolution." Thesis, Besançon, 2015. http://www.theses.fr/2015BESA2012/document.

Full text
Abstract:
En bio-informatique, comprendre comment les molécules d’ADN ont évolué au cours du temps reste un problème ouvert etcomplexe. Des algorithmes ont été proposés pour résoudre ce problème, mais ils se limitent soit à l’évolution d’un caractèredonné (par exemple, un nucléotide précis), ou se focalisent a contrario sur de gros génomes nucléaires (plusieurs milliardsde paires de base), ces derniers ayant connus de multiples événements de recombinaison – le problème étant NP completquand on considère l’ensemble de toutes les opérations possibles sur ces séquences, aucune solution n’existe à l’heureac
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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, and other styles
7

Glaudin, Lilian. "Stratégies multicouche, avec mémoire, et à métrique variable en méthodes de point fixe pour l'éclatement d'opérateurs monotones et l'optimisation." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS119.

Full text
Abstract:
Plusieurs stratégies sans liens apparents coexistent pour mettre en œuvre les algorithmes de résolution de problèmes d'inclusion monotone dans les espaces hilbertiens. Nous proposons un cadre synthétique permettant d'englober diverses approches algorithmiques pour la construction de point fixe, clarifions et généralisons leur théorie asymptotique, et concevons de nouveaux schémas itératifs pour l'analyse non linéaire et l'optimisation convexe. Notre méthodologie, qui est ancrée sur un modèle de compositions de quasicontractions moyennées, nous permet de faire avancer sur plusieurs fronts la th
APA, Harvard, Vancouver, ISO, and other styles
8

Fontaine, Allyx. "Analyses et preuves formelles d'algorithmes distribués probabilistes." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0091/document.

Full text
Abstract:
L’intérêt porté aux algorithmes probabilistes est, entre autres,dû à leur simplicité. Cependant, leur analyse peut devenir très complexeet ce particulièrement dans le domaine du distribué. Nous mettons en évidencedes algorithmes, optimaux en terme de complexité en bits résolvantles problèmes du MIS et du couplage maximal dans les anneaux, qui suiventle même schéma. Nous élaborons une méthode qui unifie les résultatsde bornes inférieures pour la complexité en bits pour les problèmes duMIS, du couplage maximal et de la coloration. La complexité de ces analysespouvant facilement mener à l’erreur
APA, Harvard, Vancouver, ISO, and other styles
9

Dementiev, Roman. "Algorithm engineering for large data sets hardware, software, algorithms." Saarbrücken VDM, Müller, 2006. http://d-nb.info/986494429/04.

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

Dementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithems"

1

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

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

Berlinski, David. The advent of the algorithm: The idea that rules the world. Harcourt, 2000.

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

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

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

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

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

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

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

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

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

Lance, Chambers, ed. The practical handbook of genetic algorithms: Applications. 2nd ed. Chapman & Hall/CRC, 2001.

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

Paul, Bratley, ed. Fundamentals of algorithmics. Prentice Hall, 1996.

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

Feldbauer, Martin. Martin Feldbauer: Allmächtiger Algorithmus = Almighty algorithm. Syker Vorwerk, 2017.

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

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Algorithems"

1

Bez, Helmut, and Tony Croft. "Quantum algorithms 2: Simon's algorithm." In Quantum Computation. Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003264569-23.

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

Hendrix, Eligius M. T., and Ana Maria A. C. Rocha. "On Local Convergence of Stochastic Global Optimization Algorithms." In Computational Science and Its Applications – ICCSA 2021. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86976-2_31.

Full text
Abstract:
AbstractIn engineering optimization with continuous variables, the use of Stochastic Global Optimization (SGO) algorithms is popular due to the easy availability of codes. All algorithms have a global and local search character, where the global behaviour tries to avoid getting trapped in local optima and the local behaviour intends to reach the lowest objective function values. As the algorithm parameter set includes a final convergence criterion, the algorithm might be running for a while around a reached minimum point. Our question deals with the local search behaviour after the algorithm r
APA, Harvard, Vancouver, ISO, and other styles
3

Bansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat, and Atulya K. Nagar. "Conclusion and Further Research Directions." In Sine Cosine Algorithm for Optimization. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_6.

Full text
Abstract:
AbstractThe increasing complexity of real-world optimization problems demands fast, robust, and efficient meta-heuristic algorithms. The popularity of these intelligent techniques is gaining popularity day by day among researchers from various disciplines of science and engineering. The sine cosine algorithm is a simple population-based stochastic approach for handling different optimization problems. In this work, we have discussed the basic sine cosine algorithm for continuous optimization problems, the multi-objective sine cosine algorithm for handling multi-objective optimization problems,
APA, Harvard, Vancouver, ISO, and other styles
4

Chalupa, Marek, Thomas A. Henzinger, Nicolas Mazzocchi, and N. Ege Saraç. "Automating the Analysis of Quantitative Automata with QuAK." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-90643-5_16.

Full text
Abstract:
Abstract Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize acceptance conditions of boolean $$\omega $$ ω -automata. Despite the theoretical advances in systems analysis through quantitative automata, the first comprehensive software tool for quantitative automata (Quantitative Automata Kit, or QuAK) was developed only recently. QuAK implements algorithms for solving standard decision problems, e.g., emptiness and universality, as well as constructions for safety an
APA, Harvard, Vancouver, ISO, and other styles
5

Ludes-Adamy, Peter, and Marcus Schütte. "Immer der Reihe nach – Algorithmen in mathematisch-informatischen Lernumgebungen für den Primarbereich." In Informatisch-algorithmische Grundbildung im Mathematikunterricht der Primarstufe. WTM-Verlag Münster, 2022. http://dx.doi.org/10.37626/ga9783959872126.0.01.

Full text
Abstract:
Kinder in der Grundschule lernen Algorithmen meist nicht explizit als solche kennen, sondern wenden zunächst erstmal Verfahren mit bestimmten geordneten Arbeitsschritten an. In einer Pilotstudie und zwei weiteren Erhebungswellen haben Schülerinnen und Schüler Lernumgebungen zu mathematisch-informatischen Inhalten, auch zum Thema Algorithmus, bearbeitet. Der Beitrag stellt Teilergebnisse vor und geht der Frage nach, inwiefern Kinder Algorithmen in dem ihnen bekannten Feld der Mathematik identifizieren und beschreiben können. In diesem Zusammenhang werden die gemeinsam hervorgebrachten Rahmungen
APA, Harvard, Vancouver, ISO, and other styles
6

"Algorithmen Algorithmus." In LaborSkills, 3rd ed., edited by Ilse Schwendenwein and Andreas Moritz. Georg Thieme Verlag, 2025. https://doi.org/10.1055/f-0002-0003-b000001051.

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

Sidhi Menon, U., Theresa Siby, and Natchimuthu Natchimuthu. "Comprehending Algorithmic Bias and Strategies for Fostering Trust in Artificial Intelligence." In Digital Technologies, Ethics, and Decentralization in the Digital Era. IGI Global, 2024. http://dx.doi.org/10.4018/979-8-3693-1762-4.ch014.

Full text
Abstract:
Fairness is threatened by algorithm bias, systematic and unfair disparities in machine learning results. Amazon's AI-driven hiring tool favoured men. AI promised data-driven, impartial decision-making, but it has revealed sector-wide prejudice, perpetuating systematic imbalances. The algorithm's bias is data and design. Biassed historical data and feature selection and pre-processing can bias algorithms. Development is harmed by human biases. Algorithm prejudice impacts money, education, employment, and crime. Diverse and representative data collection, understanding complicated “black box” al
APA, Harvard, Vancouver, ISO, and other styles
8

Das, Sahana, Kaushik Roy, and Chanchal Kumar Saha. "A Linear Time Series Analysis of Fetal Heart Rate to Detect the Variability." In Handbook of Research on Recent Developments in Intelligent Communication Application. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-1785-6.ch018.

Full text
Abstract:
Real time analysis and interpretation of fetal heart rate (FHR) is the challenge posed to every clinician. Different algorithms had been developed, tried and subsequently incorporated into Cardiotocograph (CTG) machines for automated diagnosis. Feature extraction and accurate detection of baseline and its variability has been the focus of this chapter. Algorithms by Dawes and Redman and Ayres-de-Campos have been discussed in this chapter. The authors are pleased to propose an algorithm for extracting the variability of fetal heart. The algorithm's accuracy and degree of agreement with clinicia
APA, Harvard, Vancouver, ISO, and other styles
9

Manoj, Suvvala, and Rajendran T. "Higher Prediction Accuracy on Parkinson Disease Patients Using Random Forest Algorithm over DTA." In Advances in Parallel Computing Algorithms, Tools and Paradigms. IOS Press, 2022. http://dx.doi.org/10.3233/apc220081.

Full text
Abstract:
Improving the prediction accuracy for Parkinson’s patients is achieved by applying Innovative Parkinson’s disease prediction utilizing classifiers that use machine learning methods and evaluating their performance. In this proposed work, the Innovative Parkinson’s disease prediction has been carried out using the Random Forest algorithm and the Decision Tree algorithm. It was tested over a dataset consisting of 757 records. Both algorithms were subjected to a programming experiment in which N=10 iterations were used to discover the symptoms of Innovative Parkinson’s disease prediction and thei
APA, Harvard, Vancouver, ISO, and other styles
10

Xu, Chao, Jianjun Tan, Jie Jiao, Yang Long, and Mahmoud S. Abouomar. "Genetic Algorithm with Quality of Population Evolution for Mobile Robot Path Planning Problem." In Advances in Transdisciplinary Engineering. IOS Press, 2024. http://dx.doi.org/10.3233/atde240500.

Full text
Abstract:
To address the slow convergence speed of genetic algorithms (GAs) in solving the mobile robot path planning problem, this study proposes a genetic algorithm with quality of population evolution (QPEGA). In QPEGA, the population is divided into two subpopulations based on the quality of individuals, and the quality of each subpopulation is defined. The crossover and mutation probabilities of each subpopulation are dynamically adjusted to enhance the algorithm’s solving quality. Additionally, the optimal parameter combination for the algorithm is determined using the orthogonal experimental meth
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithems"

1

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.

Full text
Abstract:
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, and other styles
2

Shoukang, Qin. "The Weighted Vector Algorithems in One Person and One Criterion." In The International Symposium on the Analytic Hierarchy Process. Creative Decisions Foundation, 1999. http://dx.doi.org/10.13033/isahp.y1999.077.

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

Jia, Haitao, and Linjie Luo. "Applying Curriculum Learning on Path-based Knowledge Graph Reasoning Algorithems." In 2021 3rd International Conference on Natural Language Processing (ICNLP). IEEE, 2021. http://dx.doi.org/10.1109/icnlp52887.2021.00019.

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

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.

Full text
Abstract:
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, and other styles
5

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
6

Showalter, Mark, Dennis Hong, and Daniel Larimer. "Development and Comparison of Gait Generation Algorithms for Hexapedal Robots Based on Kinematics With Considerations for Workspace." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49616.

Full text
Abstract:
This paper explores the interdependance of walking algorithm and limb workspace for the Multi-Appendage Robotic System (MARS). While MARS is a hexapedal robot, the tasks of defining the workspace and walking agorthm for all six limbs can be abstracted to a single limb using the constraint of a tripedal statically stable gait. Thus, by understanding the behavior of an individual limb, two walking algorithms have been developed which allow MARS to walk on level terain. Both algorithms are adaptive in that they continously update based on control inputs. The differences between the two algorithms
APA, Harvard, Vancouver, ISO, and other styles
7

Schmidt, David P., and Christopher J. Rutland. "Reducing Grid Dependency in Droplet Collision Modeling." In ASME 2001 Internal Combustion Engine Division Fall Technical Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/2001-ice-395.

Full text
Abstract:
Abstract A faster, more accurate replacement for existing collision algorithms has been developed. The method, called the NTC algorithm, is not grid dependent, and is much faster than older algorithms. Calculations with sixty thousand parcels required only a few CPU minutes. However, there is a significant need to develop mesh-independent momentum coupling between the gas and spray, so that the collision algorithm’s full accuracy can be fully realized.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
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, and other styles
9

Chandrasekaran, Arvind. "Neural Networks." In 8th International Conference on Software Engineering. Academy & Industry Research Collaboration, 2023. http://dx.doi.org/10.5121/csit.2023.131208.

Full text
Abstract:
The neural networks review the categories, explaining the organization algorithm techniques required to improve the generalization performance and the Feedforward Neural Network (FNN) learning speed. They are needed to discover the research trends changes under the six categories of the optimization algorithms for the learning rate, learning algorithms which are gradient-free. Metaheuristic algorithms collectively and new research directions are recommended for the researchers to facilitate the algorithm's understanding of the natural world applications to solve the complex engineering, manage
APA, Harvard, Vancouver, ISO, and other styles
10

Du Pont, Bryony L., and Jonathan Cagan. "An Extended Pattern Search Approach to Wind Farm Layout Optimization." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28748.

Full text
Abstract:
An extended pattern search approach is presented for optimizing the placement of wind turbines on a wind farm. The algorithm will develop a two-dimensional layout for a given number of turbines, employing an objective function that minimizes costs while maximizing the total power production of the farm. The farm cost is developed using an established simplified model that is a function of the number of turbines. The power development of the farm is estimated using an established simplified wake model, which accounts for the aerodynamic effects of turbine blades on downstream wind speed, to whi
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algorithems"

1

Gubaydullina, Zulian, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Gestaltungswille und Algorithm Aversion – Die Auswirkungen der Einflussnahme im Prozess der algorithmischen Entscheidungsfindung auf die Algorithm Aversion. Sonderforschungsgruppe Instituionenanalyse, 2021. http://dx.doi.org/10.46850/sofia.9783941627925.

Full text
Abstract:
Obwohl Algorithmen in vielen Anwendungsgebieten präzisere Prognosen abgeben als Menschen, weigern sich Entscheidungsträger häufig, auf Algorithmen zurückzugreifen. In einem ökonomischen Experiment untersuchen wir, ob das Ausmaß dieses als „Algorithm Aversion“ bekannten Phänomens reduziert werden kann, indem Entscheidungsträgern eine Einflussmöglichkeit auf die Ausgestaltung des Algorithmus eingeräumt wird (Einflussmöglichkeit auf den algorithmischen Input). Zusätzlich replizieren wir die Studie von Dietvorst, Simmons & Massey (2018). Darin zeigt sich, dass die Algorithm Aversion deutlich z
APA, Harvard, Vancouver, ISO, and other styles
2

Judek, Jan René. Die Bereitschaft zur Nutzung von Algorithmen variiert mit der sozialen Information über die schwache vs. starke Akzeptanz: Eine experimentelle Studie zur Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850037.

Full text
Abstract:
Der Prozess der Entscheidungsfindung wird in verschiedensten Kontexten immer häufiger von Algorithmen unterstützt. Das Phänomen der Algorithm Aversion steht der Entfaltung des technologischen Potenzials, das Algorithmen mit sich bringen, jedoch entgegen. Wirtschaftsakteure neigen dazu, ihre Entscheidungen an den Entscheidungen anderer Wirtschaftsakteure auszurichten. Daher wird in einem experimentellen Ansatz die Bereitschaft zur Nutzung eines Algorithmus bei der Abgabe von Aktienkursprognosen untersucht, wenn Informationen über die vorherige Nutzungsrate eines Algorithmus bereitgestellt werde
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
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, and other styles
4

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

Full text
Abstract:
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, and other styles
5

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

Full text
Abstract:
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, and other styles
6

Filiz, Ibrahim, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Die Tragik der Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2021. http://dx.doi.org/10.46850/sofia.9783941627888.

Full text
Abstract:
Algorithmen bewältigen viele Aufgaben bereits zuverlässiger als menschliche Experten. Trotzdem zeigen einige Wirtschaftssubjekte eine ablehnende Haltung gegenüber Algorithmen (Algorithm Aversion). In manchen Entscheidungssituationen kann ein Fehler schwerwiegende Konsequenzen haben, in anderen Entscheidungssituationen nicht. Wir untersuchen im Rahmen eines Framing-Experimentes den Zusammenhang zwischen der Tragweite der Entscheidungssituation einerseits und der Häufigkeit der Algorithm Aversion andererseits. Dabei zeigt sich, dass die Algorithm Aversion umso häufiger auftritt, je gravierender
APA, Harvard, Vancouver, ISO, and other styles
7

Champlin, Craig, and John P. H. Steele. DTPH56-14H-CAP06 Pipeline Assessment through 4-Dimensional Anomaly Detection and Characterization. Pipeline Research Council International, Inc. (PRCI), 2016. http://dx.doi.org/10.55274/r0011766.

Full text
Abstract:
The team intended to develop two algorithms for matching anomalies across coincident internal pipeline inspections to assess corrosion growth rates. The first algorithm would match boxed anomalies. The second algorithm would match raw signals. The goal for each algorithm is slightly different. The boxed algorithm is intended to do a complete mapping of individual called-out anomalies from one inspection to the next. The raw signal algorithm velocity corrects and aligns raw inspections signals.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
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, and other styles
9

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
10

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Full text
Abstract:
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complet
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithems' for particular source types:
Journal articles Dissertations / Theses Books
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