Zeitschriftenartikel: „Algorithm“

1

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 (30.06.2017): 614–21. http://dx.doi.org/10.31142/ijtsrd2197.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Toleushova, A. T., D. M. Uypalakova und A. B. Imansakipova. „SIGNATURE RECOGNITION ALGORITHMS. BEZIER ALGORITHM“. Bulletin of Shakarim University. Technical Sciences, Nr. 3(7) (10.02.2023): 47–53. http://dx.doi.org/10.53360/2788-7995-2022-1(5)-7.

Der volle Inhalt der Quelle

Annotation:

This article focuses on improving the human and machine interface, which should ensure efficient processing of data and knowledge in simple, fast and accessible ways. One of the ways to organize it is the introduction of the manuscript (entering text, drawings, drawings, etc.). Handwritten signatures can be considered as handwritten words, but they are more suitable for drawings, because the signer tries to make his signature unique, using not only his first and last names, but also additional graphic elements. Creating a signature is quite simple, although it is impossible to reproduce the recording speed. The signature has long been used to certify the authenticity of documents and verify (authenticate) an individual. In principle, the signature examination is used during the forensic examination. Signature recognition can be carried out by sequential verification of the signature to each known person. The signature recognition methodology includes a verification methodology and processing of verification results. One of the modern areas of interface improvement is the development and research of software for signature recognition and visualization. The advent of modern computer input tools has led to the emergence of a new type of online signature describing the signature creation process, not the result. Moreover, not only the coordinates of points on the line, but also a sequence of vectors of parameter values for each of the values of pressure, direction and speed of movement, the angle of adaptation of the pen and the signature time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Shaw, Dr Shaik Mohiddin, Dr Dharmaiah Gurram, Hari Krishna Gurram und Ramakrishna Gurram. „Transitive Closure Algorithm using Binary OR Operation: Primes Algorithm, GHK Algorithm“. SIJ Transactions on Computer Science Engineering & its Applications (CSEA) 03, Nr. 02 (23.04.2015): 01–05. http://dx.doi.org/10.9756/sijcsea/v3i2/03030100101.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Lian, Jian, Yan Zhang und Cheng Jiang Li. „An Efficient K-Shortest Paths Based Routing Algorithm“. Advanced Materials Research 532-533 (Juni 2012): 1775–79. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1775.

Der volle Inhalt der Quelle

Annotation:

We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Huang, Yuan Jiang, und Jie Huang. „A New Feature Detection Algorithm Based on RANSAC“. Advanced Materials Research 971-973 (Juni 2014): 1477–80. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1477.

Der volle Inhalt der Quelle

Annotation:

A improved RANSAC algorithm was introduced into the segmentation of LiDAR and r-radius point density was put forward to the estimation criterion,which aims to remove the discrete point outside the feature plane.an accurate registration is achieved by improving RANSAC algorithim after an analysis on the advantages and disadvantages of the algorithm for objects with many planar feature.The algorithm are implemented with VC++ and VTK platform,tested by real data collected on the test area,it verify the effectiveness and accuracy of the proposed algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Deghbouch, Hicham, und Fatima Debbat. „Hybrid Bees Algorithm with Grasshopper Optimization Algorithm for Optimal Deployment of Wireless Sensor Networks“. Inteligencia Artificial 24, Nr. 67 (20.02.2021): 18–35. http://dx.doi.org/10.4114/intartif.vol24iss67pp18-35.

Der volle Inhalt der Quelle

Annotation:

This work addresses the deployment problem in Wireless Sensor Networks (WSNs) by hybridizing two metaheuristics, namely the Bees Algorithm (BA) and the Grasshopper Optimization Algorithm (GOA). The BA is an optimization algorithm that demonstrated promising results in solving many engineering problems. However, the local search process of BA lacks efficient exploitation due to the random assignment of search agents inside the neighborhoods, which weakens the algorithmâ€™s accuracy and results in slow convergence especially when solving higher dimension problems. To alleviate this shortcoming, this paper proposes a hybrid algorithm that utilizes the strength of the GOA to enhance the exploitation phase of the BA. To prove the effectiveness of the proposed algorithm, it is applied for WSNs deployment optimization with various deployment settings. Results demonstrate that the proposed hybrid algorithm can optimize the deployment of WSN and outperforms the state-of-the-art algorithms in terms of coverage, overlapping area, average moving distance, and energy consumption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Okazaki, Hiroyuki, Yosiki Aoki und Yasunari Shidama. „Extended Euclidean Algorithm and CRT Algorithm“. Formalized Mathematics 20, Nr. 2 (01.12.2012): 175–79. http://dx.doi.org/10.2478/v10037-012-0020-2.

Der volle Inhalt der Quelle

Annotation:

Summary In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based on the source code of the NZMATH, a number theory oriented calculation system developed by Tokyo Metropolitan University [8].

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Sami N. Hussein und Nazar K. Hussein. „Improving Moth-Flame Optimization Algorithm by using Slime-Mould Algorithm“. Tikrit Journal of Pure Science 27, Nr. 1 (02.12.2022): 99–109. http://dx.doi.org/10.25130/tjps.v27i1.86.

Der volle Inhalt der Quelle

Annotation:

The MFO algorithm is one of the modern optimization algorithms based on swarm intelligence, and the SMA algorithm is also one of the latest algorithms in the same field and has the advantages of fast convergence, high convergence accuracy, robust and robust. In this research paper, we introduce an optimized algorithm for MFO based on the SMA algorithm to get better performance using the features in the two algorithms, and two different algorithms are proposed in this field. The two predicted new algorithms were tested with standard test functions and the results were encouraging compared to the standard algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Beth, T., und D. Gollman. „Algorithm engineering for public key algorithms“. IEEE Journal on Selected Areas in Communications 7, Nr. 4 (Mai 1989): 458–66. http://dx.doi.org/10.1109/49.17708.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Kulkarni, Anuj, Saish Padave, Satyam Shrivastava und Mrs Vidya Kawtikwar. „Algorithm Visualizer“. International Journal for Research in Applied Science and Engineering Technology 11, Nr. 7 (31.07.2023): 1818–23. http://dx.doi.org/10.22214/ijraset.2023.54837.

Der volle Inhalt der Quelle

Annotation:

Abstract: In recent years, computer science education has become increasingly important as technology continues to play a dominant role in our lives. The understanding of algorithms and their implementation is a crucial aspect of computer science education. Visualizing algorithms can be a powerful tool to help students understand and retain the concepts behind them. This paper presents a new algorithm visualizer that focuses on two main types of algorithms: sorting algorithms and graph pathfinding algorithms. The algorithm visualizer was created using React.js, a popular JavaScript library, and provides visualizations for various sorting algorithms, such as merge sort, quick sort, heap sort, and bubble sort. Additionally, the visualizer includes visualizations for graph pathfinding algorithms such as breadth-first search, depth-first search, and A*. The visualizer also includes mazes and patterns that can be solved using the pathfinding algorithms, allowing users to see the algorithms in action. The algorithm visualizer provides a user-friendly interface that allows users to step through the algorithms and see how they work. This interactive approach to learning algorithms provides a valuable resource for students and educators alike. The visualizer is also highly customizable, allowing users to adjust the speed and complexity of the algorithms to fit their needs. This paper provides a comprehensive overview of the design, implementation, and evaluation of the algorithm visualizer.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Yazdani, Maziar, und Fariborz Jolai. „Lion Optimization Algorithm (LOA): A nature-inspired metaheuristic algorithm“. Journal of Computational Design and Engineering 3, Nr. 1 (16.06.2015): 24–36. http://dx.doi.org/10.1016/j.jcde.2015.06.003.

Der volle Inhalt der Quelle

Annotation:

Abstract During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Erdemir, Erkan. „Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm“. International Journal of Industrial Engineering Computations 14, Nr. 2 (2023): 309–22. http://dx.doi.org/10.5267/j.ijiec.2023.1.002.

Der volle Inhalt der Quelle

Annotation:

Metaheuristic algorithms are easy, flexible and nature-inspired algorithms used to optimize functions. To make metaheuristic algorithms better, multiple algorithms are combined and hybridized. In this context, a hybrid algorithm (HSSAOA) was developed by adapting the exploration phase of the arithmetic optimization algorithm (AOA) to the position update part of the salp swarm algorithm (SSA) of the leader salps/salps. And also, there have also been a few new additions to the SSA. The proposed HSSAOA was tested in three different groups using 22 benchmark functions and compared with 7 well-known algorithms. HSSAOA optimized the best results in a total of 16 benchmark functions in each group. In addition, a statistically significant difference was obtained compared to other algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Chen, Zheyuan, Jiani Lu, Yuqi Shang und Diwen Xu. „Path planning algorithms of sweeping robots“. Applied and Computational Engineering 41, Nr. 1 (22.02.2024): 99–105. http://dx.doi.org/10.54254/2755-2721/41/20230716.

Der volle Inhalt der Quelle

Annotation:

Different categories of path planning algorithms for sweeping robot are introduced, including Dijkstra algorithm and A*Algorithm in Traditional path-planning Algorithm, PRM Algorithm and RRT Algorithm in sampling algorithm, and Ant Colony Optimization Algorithms and Genetic algorithms in Intelligent bionic algorithm. Each algorithm has its principles and features introduced. At the same time, several algorithms are compared, and summarized, each algorithm has its advantages and disadvantages, in the future development should be combined with their strengths to optimize the path planning algorithm of the sweeping robot.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Andriansyah, Andriansyah, und Prima Denny Sentia. „PENENTUAN RUTE KENDARAAN PADA SISTEM DISTRIBUSI LOGISTIK PASCA BENCANA (STUDI KASUS)“. Jurnal Manajemen Industri dan Logistik 2, Nr. 1 (04.12.2018): 79–89. http://dx.doi.org/10.30988/jmil.v2i1.28.

Der volle Inhalt der Quelle

Annotation:

The success indicators of disaster mitigation can be seen from the disaster logistics system. Effective and efficient distribution network can make a good disaster logistics system. The problem that related to the design of this network is the vehicle routing problem. The objective is determined optimal route of relief distribution from warehouse to victims with minimum time duration. The problem is solved by branch and bound, insertion heuristic, and local search algorithms. The results obtained by branch and bound and local search algorithm are optimal global. Time duration of vehicle using these algoritm is 1.0562 hours. However, computation time using branch and bound algorithm is very long until 22 hours while local search algorithm only takes 60 seconds. The insertion heuristic algorithm also produces a good solution. Time duration of vehicle using this algoritm is 1,1030 hours. This solution is local optimal, but the computation time is very short, only 0.001 seconds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Jiang, Dazhi, und Zhun Fan. „The Algorithm for Algorithms: An Evolutionary Algorithm Based on Automatic Designing of Genetic Operators“. Mathematical Problems in Engineering 2015 (2015): 1–15. http://dx.doi.org/10.1155/2015/474805.

Der volle Inhalt der Quelle

Annotation:

At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. A fundamental question is “are there any algorithms that can design evolutionary algorithms automatically?” A more complete definition of the question is “can computer construct an algorithm which will generate algorithms according to the requirement of a problem?” In this paper, a novel evolutionary algorithm based on automatic designing of genetic operators is presented to address these questions. The resulting algorithm not only explores solutions in the problem space like most traditional evolutionary algorithms do, but also automatically generates genetic operators in the operator space. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted. The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Huang, Yuxuan, und Yiming Ren. „A new interpolation algorithm based on Hibbard-Laroche algorithm and its superiority“. Applied and Computational Engineering 15, Nr. 1 (23.10.2023): 119–33. http://dx.doi.org/10.54254/2755-2721/15/20230822.

Der volle Inhalt der Quelle

Annotation:

In order to optimize the possible problems and improvements in the existing color image restoration interpolation algorithms, we conduct research based on the existing bilinear interpolation method, cok algorithm and Hibbard-Laroche algorithm. Our method is to use our own comparison method to compare different types of images through three algorithms to find the advantages and disadvantages and to some extent combine the advantages of bilinear interpolation and Hibbard-Laroche algorithm to try to innovate a new algorithm to compare with the existing three algorithms. The results show that the existing three algorithms have their own advantages in different scenarios, and the new algorithm is superior to the existing algorithms in terms of clarity and color restoration accuracy in most scenarios. However, due to the large computational complexity, the operation speed is slow.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Nico, Nico, Novrido Charibaldi und 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, Nr. 1 (30.05.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 algorithms among evolutionary algorithms for scheduling are genetic algorithms and memetics algorithms. When it comes to the two algorithms, using genetic algorithms or memetics algorithms may not always offer the optimum outcomes in every situation. Therefore, it is necessary to compare the genetic algorithm and the algorithm's memetic algorithm to determine which one is suitable for the nurse picket schedule. From the results of this study, the memetic algorithm is better than the genetic algorithm in making picket schedules. The memetic algorithm with a population of 10000 and a generation of 5000 does not produce convergent data. While for the genetic algorithm, when the population is 5000 and the generation is 50, the data convergence starts. For accuracy, the memetic algorithm violates only 24 of the 124 existing constraints (80,645%). The genetic algorithm violates 27 of the 124 constraints (78,225%). The average runtime used to generate optimal data using the memetic algorithm takes 20.935592 seconds. For the genetic algorithm, it takes longer, as much as 53.951508 seconds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Zhang, Zhaoyang. „Review on String-Matching Algorithm“. SHS Web of Conferences 144 (2022): 03018. http://dx.doi.org/10.1051/shsconf/202214403018.

Der volle Inhalt der Quelle

Annotation:

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matching (BNDM) algorithm is a modern practical algorithm that is an outstanding combination of theoretical research and practical application. Those meaningful algorithms play a guiding role in future research in string-search algorithm to improve the average performance of the algorithm and reduce resource consumption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Chen, Zhenpeng, Yuanjie Zheng, Xiaojie Li, Rong Luo, Weikuan Jia, Jian Lian und Chengjiang Li. „Interactive Trimap Generation for Digital Matting Based on Single-Sample Learning“. Electronics 9, Nr. 4 (17.04.2020): 659. http://dx.doi.org/10.3390/electronics9040659.

Der volle Inhalt der Quelle

Annotation:

Image matting refers to the task of estimating the foreground of images, which is an important problem in image processing. Recently, trimap generation has attracted considerable attention because designing a trimap for every image is labor-intensive. In this paper, a two-step algorithm is proposed to generate trimaps. To use the proposed algorithm, users must only provide some clicks (foreground clicks and background clicks), which are employed as the input to generate a binary mask. One-shot learning technique achieves remarkable progress on semantic segmentation, we extend this technique to perform the binary mask prediction task. The mask is further used to predict the trimap using image dilation. Extensive experiments were performed to evaluate the proposed algorithm. Experimental results show that the trimaps generated using the proposed algorithm are visually similar to the user-annotated ones. Comparing with the interactive matting algorithms, the proposed algoritm is less labor-intensive than trimap-based matting algorithm and achieved more accuate results than scribble-based matting algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Li, Yifeng, und Ying Tan. „Hierarchical Collaborated Fireworks Algorithm“. Electronics 11, Nr. 6 (18.03.2022): 948. http://dx.doi.org/10.3390/electronics11060948.

Der volle Inhalt der Quelle

Annotation:

The fireworks algorithm (FWA) has achieved significant global optimization ability by organizing multiple simultaneous local searches. By dynamically decomposing the target problem and handling each one with a sub-population, it has presented distinct property and applicability compared with traditional evolutionary algorithms. In this paper, we extend the theoretical model of fireworks algorithm based on search space partition to obtain a hierarchical collaboration model. It maintains both multiple local fireworks for local exploitation and one global firework for overall population distribution control. The implemented hierarchical collaborated fireworks algorithm is able to combine the advantages of both classic evolutionary algorithms and fireworks algorithms. Several experiments are provided for in-depth analysis and discussion on the proposed algorithm. The effectiveness of proposed strategy is demonstrated on the benchmark test suite from CEC 2020. Experimental results validate that the hierarchical collaborated fireworks algorithm outperforms former fireworks algorithms significantly and achieves similar results compared with state-of-the-art evolutionary algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Mitsos, Alexander, Jaromił Najman und Ioannis G. Kevrekidis. „Optimal deterministic algorithm generation“. Journal of Global Optimization 71, Nr. 4 (13.02.2018): 891–913. http://dx.doi.org/10.1007/s10898-018-0611-8.

Der volle Inhalt der Quelle

Annotation:

Abstract A formulation for the automated generation of algorithms via mathematical programming (optimization) is proposed. The formulation is based on the concept of optimizing within a parameterized family of algorithms, or equivalently a family of functions describing the algorithmic steps. The optimization variables are the parameters—within this family of algorithms—that encode algorithm design: the computational steps of which the selected algorithms consist. The objective function of the optimization problem encodes the merit function of the algorithm, e.g., the computational cost (possibly also including a cost component for memory requirements) of the algorithm execution. The constraints of the optimization problem ensure convergence of the algorithm, i.e., solution of the problem at hand. The formulation is described prototypically for algorithms used in solving nonlinear equations and in performing unconstrained optimization; the parametrized algorithm family considered is that of monomials in function and derivative evaluation (including negative powers). A prototype implementation in GAMS is provided along with illustrative results demonstrating cases for which well-known algorithms are shown to be optimal. The formulation is a mixed-integer nonlinear program. To overcome the multimodality arising from nonconvexity in the optimization problem, a combination of brute force and general-purpose deterministic global algorithms is employed to guarantee the optimality of the algorithm devised. We then discuss several directions towards which this methodology can be extended, their scope and limitations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Tilahun, Surafel Luleseged, und Hong Choon Ong. „Prey-Predator Algorithm: A New Metaheuristic Algorithm for Optimization Problems“. International Journal of Information Technology & Decision Making 14, Nr. 06 (November 2015): 1331–52. http://dx.doi.org/10.1142/s021962201450031x.

Der volle Inhalt der Quelle

Annotation:

Nature-inspired optimization algorithms have become useful in solving difficult optimization problems in different disciplines. Since the introduction of evolutionary algorithms several studies have been conducted on the development of metaheuristic optimization algorithms. Most of these algorithms are inspired by biological phenomenon. In this paper, we introduce a new algorithm inspired by prey-predator interaction of animals. In the algorithm randomly generated solutions are assigned as a predator and preys depending on their performance on the objective function. Their performance can be expressed numerically and is called the survival value. A prey will run towards the pack of preys with better surviving values and away from the predator. The predator chases the prey with the smallest survival value. However, the best prey or the prey with the best survival value performs a local search. Hence the best prey focuses fully on exploitation while the other solution members focus on the exploration of the solution space. The algorithm is tested on selected well-known test problems and a comparison is also done between our algorithm, genetic algorithm and particle swarm optimization. From the simulation result, it is shown that on the selected test problems prey-predator algorithm performs better in achieving the optimal value.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Hiendro, Ayong. „Projectile-target search algorithm: a stochastic metaheuristic optimization technique“. International Journal of Electrical and Computer Engineering (IJECE) 9, Nr. 5 (01.10.2019): 3772. http://dx.doi.org/10.11591/ijece.v9i5.pp3772-3778.

Der volle Inhalt der Quelle

Annotation:

This paper proposes a new stochastic metaheuristic optimization algorithm which is based on kinematics of projectile motion and called projectile-target search (PTS) algorithm. The PTS algorithm employs the envelope of projectile trajectory to find the target in the search space. It has 2 types of control parameters. The first type is set to give the possibility of the algorithm to accelerate convergence process, while the other type is set to enhance the possibility to generate new better projectiles for searching process. However, both are responsible to find better fitness values in the search space. In order to perform its capability to deal with global optimum problems, the PTS algorithm is evaluated on six well-known benchmarks and their shifted functions with 100 dimensions. Optimization results have demonstrated that the PTS algoritm offers very good performances and it is very competitive compared to other metaheuristic algorithms

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Ababneh, Jehad. „Greedy particle swarm and biogeography-based optimization algorithm“. International Journal of Intelligent Computing and Cybernetics 8, Nr. 1 (09.03.2015): 28–49. http://dx.doi.org/10.1108/ijicc-01-2014-0003.

Der volle Inhalt der Quelle

Annotation:

Purpose – The purpose of this paper is to propose an algorithm that combines the particle swarm optimization (PSO) with the biogeography-based optimization (BBO) algorithm. Design/methodology/approach – The BBO and the PSO algorithms are jointly used in to order to combine the advantages of both algorithms. The efficiency of the proposed algorithm is tested using some selected standard benchmark functions. The performance of the proposed algorithm is compared with that of the differential evolutionary (DE), genetic algorithm (GA), PSO, BBO, blended BBO and hybrid BBO-DE algorithms. Findings – Experimental results indicate that the proposed algorithm outperforms the BBO, PSO, DE, GA, and the blended BBO algorithms and has comparable performance to that of the hybrid BBO-DE algorithm. However, the proposed algorithm is simpler than the BBO-DE algorithm since the PSO does not have complex operations such as mutation and crossover used in the DE algorithm. Originality/value – The proposed algorithm is a generic algorithm that can be used to efficiently solve optimization problems similar to that solved using other popular evolutionary algorithms but with better performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Brooks, Stephen P. „Algorithms AS 298: A Hybrid Optimization Algorithm“. Applied Statistics 44, Nr. 4 (1995): 530. http://dx.doi.org/10.2307/2986143.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Jobson, K. „International Psychopharmacology Algorithm Project: Algorithms in Psychopharmacology“. International Journal of Psychiatry in Clinical Practice 1, sup1 (Januar 1997): S3. http://dx.doi.org/10.3109/13651509709024748.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Chatain, Peter, Rocky Garg und Lauren Tompkins. „Evolutionary Algorithms for Tracking Algorithm Parameter Optimization“. EPJ Web of Conferences 251 (2021): 03071. http://dx.doi.org/10.1051/epjconf/202125103071.

Der volle Inhalt der Quelle

Annotation:

The reconstruction of charged particle trajectories, known as tracking, is one of the most complex and CPU consuming parts of event processing in high energy particle physics experiments. The most widely used and best performing tracking algorithms require significant geometry-specific tuning of the algorithm parameters to achieve best results. In this paper, we demonstrate the usage of machine learning techniques, particularly evolutionary algorithms, to find high performing configurations for the first step of tracking, called track seeding. We use a track seeding algorithm from the software framework A Common Tracking Software (ACTS). ACTS aims to provide an experimentindependent and framework-independent tracking software designed for modern computing architectures. We show that our optimization algorithms find highly performing configurations in ACTS without hand-tuning. These techniques can be applied to other reconstruction tasks, improving performance and reducing the need for laborious hand-tuning of parameters.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

S, Gajawada. „Lord Rama Devotees Algorithm: A New Human-Inspired Metaheuristic Optimization Algorithm“. Advances in Robotic Technology 1, Nr. 1 (02.10.2023): 1–2. http://dx.doi.org/10.23880/art-16000105.

Der volle Inhalt der Quelle

Annotation:

Several Human-Inspired Metaheuristic Optimization Algorithms were proposed in literature. But the concept of DevoteesInspired Metaheuristic Optimization Algorithms is not yet explored. In this article, Lord Rama Devotees Algorithm (LRDA) is proposed which is a new Devotees-Inspired Metaheuristic Optimization Algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Wu, Hai Fei, und Tong Zhao. „A Study of MRife Algorithm and CSB Algorithm on Frequency Online Estimation“. Applied Mechanics and Materials 128-129 (Oktober 2011): 789–93. http://dx.doi.org/10.4028/www.scientific.net/amm.128-129.789.

Der volle Inhalt der Quelle

Annotation:

Online estimation of instantaneous frequencies is a method to treat information signals by following a set of certain algorithm for the purpose of extracting the sine wave signal frequency that is overwhelmed in the noise. Among several algorithms available nowadays, two are selected here-one is the modification of Rife (MRife) algorithm based on frequency-domain analysis; and the other is the correlation series based (CSB) algorithm. With simulation methods, the estimation error, stabilization time and computation load of these two algorithms are analyzed and compared respectively. Finally, these two algorithms are applied to estimate the vibration signal frequency of the diesel engine’s base under normal operating conditions. From the results, we come to the conclusion that MRife algorithm and CSB algorithm both have their specific advantages, whereas MRife algorithm is more applicable in the view of estimation error.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Lie, Luo. „Heuristic Artificial Intelligent Algorithm for Genetic Algorithm“. Key Engineering Materials 439-440 (Juni 2010): 516–21. http://dx.doi.org/10.4028/www.scientific.net/kem.439-440.516.

Der volle Inhalt der Quelle

Annotation:

A genetic algorithm is a search technique used in computing to find exact or approximate solutions to optimization and search problems. Genetic algorithms are categorized as global search heuristics. Genetic algorithms are a particular class of evolutionary algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Zeng, Yi, Shiqun Yin, Jiangyue Liu und Miao Zhang. „Research of Improved FP-Growth Algorithm in Association Rules Mining“. Scientific Programming 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/910281.

Der volle Inhalt der Quelle

Annotation:

Association rules mining is an important technology in data mining. FP-Growth (frequent-pattern growth) algorithm is a classical algorithm in association rules mining. But the FP-Growth algorithm in mining needs two times to scan database, which reduces the efficiency of algorithm. Through the study of association rules mining and FP-Growth algorithm, we worked out improved algorithms of FP-Growth algorithm—Painting-Growth algorithm and N (not) Painting-Growth algorithm (removes the painting steps, and uses another way to achieve). We compared two kinds of improved algorithms with FP-Growth algorithm. Experimental results show that Painting-Growth algorithm is more than 1050 and N Painting-Growth algorithm is less than 10000 in data volume; the performance of the two kinds of improved algorithms is better than that of FP-Growth algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Mahmud, Hasan, A. K. M. Najmul Islam, Xin (Robert) Luo und Patrick Mikalef. „Decoding algorithm appreciation: Unveiling the impact of familiarity with algorithms, tasks, and algorithm performance“. Decision Support Systems 179 (April 2024): 114168. http://dx.doi.org/10.1016/j.dss.2024.114168.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Ratseev, S. M., und O. I. Cherevatenko. „ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES“. Vestnik of Samara University. Natural Science Series 26, Nr. 3 (06.05.2020): 17–29. http://dx.doi.org/10.18287/2541-7525-2020-26-3-17-29.

Der volle Inhalt der Quelle

Annotation:

The article is devoted to the decoding algorithms for generalized Reed Solomon codes with errorsand erasures. These algorithms are based on Gao algorithm, Sugiyama algorithm, Berlekamp Massey algorithm (Peterson Gorenstein Zierler algorithm). The first of these algorithms belongs to syndrome-free decoding algorithms, the others to syndrome decoding algorithms. The relevance of these algorithms is that they are applicable for decoding Goppa codes, which are the basis of some promising post-quantum cryptosystems. These algorithms are applicable for Goppa codes over an arbitrary field, as opposed to the well-known Patterson decoding algorithm for binary Goppa codes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Tan, Ying, Chao Yu, Shaoqiu Zheng und Ke Ding. „Introduction to Fireworks Algorithm“. International Journal of Swarm Intelligence Research 4, Nr. 4 (Oktober 2013): 39–70. http://dx.doi.org/10.4018/ijsir.2013100103.

Der volle Inhalt der Quelle

Annotation:

Inspired by fireworks explosion at night, conventional fireworks algorithm (FWA) was developed in 2010. Since then, several improvements and applications were proposed to improve the efficiency of FWA. In this paper, the conventional fireworks algorithm is first summarized and three improved fireworks algorithms are provided. By changing the ways of calculating the numbers and amplitudes of sparks in fireworks' explosion, the improved FWA algorithms become more reasonable and explainable. In addition, the multi-objective fireworks algorithm and the graphic processing unit (GPU) based fireworks algorithm are also presented, particularly the GPU based fireworks algorithm is able to speed up the optimization process considerably. Extensive experiments on 13 benchmark functions demonstrate that the three improved fireworks algorithms significantly increase the accuracy of found solutions, yet decrease the running time dramatically. At last, some applications of fireworks algorithm are briefly described, while its shortcomings and future research directions are identified.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Hirata, Hiroaki, und Atsushi Nunome. „A Modified Parallel Heapsort Algorithm“. International Journal of Software Innovation 8, Nr. 3 (Juli 2020): 1–18. http://dx.doi.org/10.4018/ijsi.2020070101.

Der volle Inhalt der Quelle

Annotation:

Sorting is a fundamental and essential problem required in the wide range of application fields, and so many sorting algorithms have been developed. Among those algorithms, heapsort is one of the most elegant and efficient sorting algorithms. But no parallel heapsort algorithm had been presented until the authors developed a restricted parallel algorithm a few years ago. This parallel algorithm had a restriction which makes it difficult to be used universally for general data sets. So, in this article, the authors present a modified parallel algorithm which is free from such restriction and can be used for any data set. This new algorithm can achieve almost the same performance as the restricted algorithm the authors developed before.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Xiao, Shi Song, Ao Lin Wang und Hui Feng. „An Improved Algorithm Based on AC-BM Algorithm“. Applied Mechanics and Materials 380-384 (August 2013): 1576–79. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1576.

Der volle Inhalt der Quelle

Annotation:

The pattern matching algorithm is the mainstream technology in the instruction detection system, and therefore as a pattern-matching methods core string matching algorithm directly affect an intrusion detection system performance and efficiency. So based on the discussions of the most fashionable pattern matching algorithms at present, an improved algorithm of AC-BM is presented. From the experiments in the Snort ,it is concluded that the improved algorithm of the performance and efficiency is higher than AC-BM algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Litvinchuk, Yuliia. „Self-adaptive CMA-ES Algorithm“. Mathematical and computer modelling. Series: Physical and mathematical sciences 24 (05.12.2023): 81–90. http://dx.doi.org/10.32626/2308-5878.2023-24.81-90.

Der volle Inhalt der Quelle

Annotation:

This article will consider one of the self-adaptive algorithms for selecting parameters of complex systems, examples of which are neural networks. Self-adaptive algorithms are algorithms that change their behavior at runtime based on available information and predetermined reward mechanisms. These algorithms are widely used in various fields, including machine learning, optimization, and data compression. The self-adaptiveness of the algorithm in this case will be based on the selection of the number of peaks in the mixture of distributions in the extended CMA-ES algorithm under the condition of a normal base distribution. The work presents an improved self-adaptive CMA-ES algorithm, with an emphasis on the parameter that selects the number of pixels in a mixture of normal distributions. The algorithm takes into account the methods of setting this optimal value, which is used when choosing cluster numbers in the CURE, BIRCH, etc. clustering algorithms. It is obvious that the given justification of this approach can be extended to mixtures with a different base distribution, each of which is characterized by a skin number of peaks in the mixture distribution. This implies self-adaptability and applicability of the algorithm to a wider range of scenarios involving different distribution characteristics. There is no doubt that the proposed sado-adaptive parameter setting algorithm, based on the CMA-ES algorithm, can be extended to other genetic and evolutionary algorithms that include the selection of additional chromosomes (individuals) during the transition between iteration epochs of the algorithm. Another feature of the proposed algorithm is the use of theoretical foundations of cluster analysis to estimate the number of peaks in the distribution of chromosomes. This approach is widely used in the latest self-adaptive algorithms for determining the initial parameters (hyperparameters) of complex systems

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Liu, Zizhuo. „Investigation of progress and application related to Multi-Armed Bandit algorithms“. Applied and Computational Engineering 37, Nr. 1 (22.01.2024): 155–59. http://dx.doi.org/10.54254/2755-2721/37/20230496.

Der volle Inhalt der Quelle

Annotation:

This paper discusses four Multi-armed Bandit algorithms: Explore-then-Commit (ETC), Epsilon-Greedy, Upper Confidence Bound (UCB), and Thompson Sampling algorithm. ETC algorithm aims to spend the majority of rounds on the best arm, but it can lead to a suboptimal outcome if the environment changes rapidly. The Epsilon-Greedy algorithm is designed to explore and exploit simultaneously, while it often tries sub-optimal arm even after the algorithm finds the best arm. Thus, the Epsilon-Greedy algorithm performs well when the environment continuously changes. UCB algorithm is one of the most used Multi-armed Bandit algorithms because it can rapidly narrow the potential optimal decisions in a wide range of scenarios; however, the algorithm can be influenced by some specific pattern of reward distribution or noise presenting in the environment. Thompson Sampling algorithm is also one of the most common algorithms in the Multi-armed Bandit algorithm due to its simplicity, effectiveness, and adaptability to various reward distributions. The Thompson Sampling algorithm performs well in multiple scenarios because it explores and exploits simultaneously, but its variance is greater than the three algorithms mentioned above. Today, Multi-armed bandit algorithms are widely used in advertisement, health care, and website and app optimization. Finally, the Multi-armed Bandit algorithms are rapidly replacing the traditional algorithms; in the future, the advanced Multi-armed Bandit algorithm, contextual Multi-armed Bandit algorithm, will gradually replace the old one.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Challenger, Moharram, Elif Haytaoglu, Gorkem Tokatli, Orhan Dagdeviren und Kayhan Erciyes. „A Hybrid Distributed Mutual Exclusion Algorithm for Cluster-Based Systems“. Mathematical Problems in Engineering 2013 (2013): 1–15. http://dx.doi.org/10.1155/2013/703414.

Der volle Inhalt der Quelle

Annotation:

Distributed mutual exclusion is a fundamental problem which arises in various systems such as grid computing, mobile ad hoc networks (MANETs), and distributed databases. Reducing key metrics like message count per any critical section (CS) and delay between two CS entrances, which is known as synchronization delay, is a great challenge for this problem. Various algorithms use either permission-based or token-based protocols. Token-based algorithms offer better communication costs and synchronization delay. Raymond's and Suzuki-Kasami's algorithms are well-known token-based ones. Raymond's algorithm needs onlyO(log2(N)) messages per CS and Suzuki-Kasami's algorithm needs just one message delivery time between two CS entrances. Nevertheless, both algorithms are weak in the other metric, synchronization delay and message complexity correspondingly. In this work, a new hybrid algorithm is proposed which gains from powerful aspects of both algorithms. Raysuz's algorithm (the proposed algorithm) uses a clustered graph and executes Suzuki-Kasami's algorithm intraclusters and Raymond's algorithm interclusters. This leads to have better message complexity than that of pure Suzuki-Kasami's algorithm and better synchronization delay than that of pure Raymond's algorithm, resulting in an overall efficient DMX algorithm pure algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Gupta, Medha, und Divya Gupta. „A New Modified Firefly Algorithm“. International Journal of Recent Contributions from Engineering, Science & IT (iJES) 4, Nr. 2 (05.07.2016): 18. http://dx.doi.org/10.3991/ijes.v4i2.5879.

Der volle Inhalt der Quelle

Annotation:

Nature inspired meta-heuristic algorithms studies the emergent collective intelligence of groups of simple agents. Firefly Algorithm is one of the new such swarm-based metaheuristic algorithm inspired by the flashing behavior of fireflies. The algorithm was first proposed in 2008 and since then has been successfully used for solving various optimization problems. In this work, we intend to propose a new modified version of Firefly algorithm (MoFA) and later its performance is compared with the standard firefly algorithm along with various other meta-heuristic algorithms. Numerical studies and results demonstrate that the proposed algorithm is superior to existing algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Qiu, Jian Lin, Li Chen, Jian Ping Chen, Xiang Gu und Yan Yun Chen. „Grid-Based Task Scheduling PMTS Algorithm“. Applied Mechanics and Materials 121-126 (Oktober 2011): 4491–97. http://dx.doi.org/10.4028/www.scientific.net/amm.121-126.4491.

Der volle Inhalt der Quelle

Annotation:

This paper analyses the Min-min algorithm and its improved algorithms through the performances of load balance, time span, quality of service and economic principle. Based on the analysis of the merits of these algorithms, we propose an improved algorithm as PMTS (Priority-based maximum time-span algorithm) by integrating. In the instance of the application, we analyse and compare the performances of these algorithms, and experimental results show that, PMTS algorithm is better than other algorithms in the comprehensive performance of load-balance, time-span, quality of service and other aspects.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

YE, DESHI, und QINMING HE. „WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION“. International Journal of Foundations of Computer Science 22, Nr. 04 (Juni 2011): 971–82. http://dx.doi.org/10.1142/s0129054111008519.

Der volle Inhalt der Quelle

Annotation:

We study the worst-case performance of approximation algorithms for the problem of multiprocessor task scheduling on m identical processors with resource augmentation, whose objective is to minimize the makespan. In this case, the approximation algorithms are given k (k ≥ 0) extra processors than the optimal off-line algorithm. For on-line algorithms, the Greedy algorithm and shelf algorithms are studied. For off-line algorithm, we consider the LPT (longest processing time) algorithm. Particularly, we prove that the schedule produced by the LPT algorithm is no longer than the optimal off-line algorithm if and only if k ≥ m - 2.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Wang, Yizhun. „Review on greedy algorithm“. Theoretical and Natural Science 14, Nr. 1 (30.11.2023): 233–39. http://dx.doi.org/10.54254/2753-8818/14/20241041.

Der volle Inhalt der Quelle

Annotation:

The greedy algorithm is a commonly used algorithm design idea that can provide efficient solutions to many practical problems. This paper aims to review and summarize the basic ideas, characteristics and application fields of greedy algorithms, and discuss their advantages and limitations. Firstly, the basic concepts of greedy algorithms are introduced, including the greedy selection properties and optimal substructures. Then, some classic greedy algorithms such as the backpack problem, the activity selection problem, and the minimum spanning tree problem are introduced, and the concept of time complexity is introduced. Next, the application of greedy algorithms in practical problems, such as scheduling problems, network routing, and graph generation, will be discussed. Finally, the advantages of the greedy algorithm and the limitation of the inability to obtain the global optimal solution will be evaluated, and the improvement direction combined with other algorithms will be proposed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Daili, Noureddine. „NOTE ON AN ALGORITHM THAT HIDES AN OTHER ALGORITHM“. Journal of Mathematical Sciences: Advances and Applications 70, Nr. 1 (10.04.2022): 53–64. http://dx.doi.org/10.18642/jmsaa_7100122249.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Kaya, Ebubekir, Ceren Baştemur Kaya, Emre Bendeş, Sema Atasever, Başak Öztürk und Bilgin Yazlık. „Training of Feed-Forward Neural Networks by Using Optimization Algorithms Based on Swarm-Intelligent for Maximum Power Point Tracking“. Biomimetics 8, Nr. 5 (01.09.2023): 402. http://dx.doi.org/10.3390/biomimetics8050402.

Der volle Inhalt der Quelle

Annotation:

One of the most used artificial intelligence techniques for maximum power point tracking is artificial neural networks. In order to achieve successful results in maximum power point tracking, the training process of artificial neural networks is important. Metaheuristic algorithms are used extensively in the literature for neural network training. An important group of metaheuristic algorithms is swarm-intelligent-based optimization algorithms. In this study, feed-forward neural network training is carried out for maximum power point tracking by using 13 swarm-intelligent-based optimization algorithms. These algorithms are artificial bee colony, butterfly optimization, cuckoo search, chicken swarm optimization, dragonfly algorithm, firefly algorithm, grasshopper optimization algorithm, krill herd algorithm, particle swarm optimization, salp swarm algorithm, selfish herd optimizer, tunicate swarm algorithm, and tuna swarm optimization. Mean squared error is used as the error metric, and the performances of the algorithms in different network structures are evaluated. Considering the results, a success ranking score is obtained for each algorithm. The three most successful algorithms in both training and testing processes are the firefly algorithm, selfish herd optimizer, and grasshopper optimization algorithm, respectively. The training error values obtained with these algorithms are 4.5 × 10−4, 1.6 × 10−3, and 2.3 × 10−3, respectively. The test error values are 4.6 × 10−4, 1.6 × 10−3, and 2.4 × 10−3, respectively. With these algorithms, effective results have been achieved in a low number of evaluations. In addition to these three algorithms, other algorithms have also achieved mostly acceptable results. This shows that the related algorithms are generally successful ANFIS training algorithms for maximum power point tracking.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Lin, Ying Jian, und Xiao Ji Chen. „Simulated Annealing Algorithm Improved BP Learning Algorithm“. Applied Mechanics and Materials 513-517 (Februar 2014): 734–37. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.734.

Der volle Inhalt der Quelle

Annotation:

BP learning algorithm has advantage of simple structure, easy to implement and so on, it has gained wide application in the malfunction diagnosis and pattern recognition etc.. For BP algorithm is easy to fall into local minima shortcoming cites simulated annealing algorithm. Firstly, study the basic idea of BP learning algorithm and its simple mathematical representation; Then, research simulated annealing algorithm theory and annealing processes; Finally, the study makes BP algorithm combine with simulated annealing algorithm to form a hybrid optimization algorithm of simulated annealing algorithm based on genetic and improved BP algorithm, and gives specific calculation steps. The results show that the content of this study give full play to their respective advantages of two algorithms, make best use of the advantages and bypass the disadvantages, whether in academic or in the application it has a very important significance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

EL ABBADI, NIDHAL K., und ZAID YAHYA A. KAREEM. „NK-SORTING ALGORITHM“. Journal of Kufa for Mathematics and Computer 1, Nr. 4 (30.11.2011): 27–35. http://dx.doi.org/10.31642/jokmc/2018/010404.

Der volle Inhalt der Quelle

Annotation:

Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity.Many algorithms are very well known for sorting the unordered lists.In this proposed algorithm, we suggested a new algorithm for sorting integers number depending on dividing the input array to many sub-arrays (which represents a vector or array with one dimension), according to the number of digits in each integer number, the relation between sub-array elements is determined, and this relation used to determines the right location of each element in sub-arrays.Â Collision may happen, which is solved by moving elements in sub-array to next location. Finally, all ordered sub-arrays will be merged together to rebuild the origin array. The proposed algorithm compared with many famous algorithms gives promising results.Â

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Sumertajaya, I. Made Sumertajaya, Wiwik Andriyani Lestari Ningsih, Asep Saefuddin und Embay Rohaeti. „Biclustering Performance Evaluation of Cheng and Church Algorithm and Iterative Signature Algorithm“. JTAM (Jurnal Teori dan Aplikasi Matematika) 7, Nr. 3 (17.07.2023): 643. http://dx.doi.org/10.31764/jtam.v7i3.14778.

Der volle Inhalt der Quelle

Annotation:

Biclustering has been widely applied in recent years. Various algorithms have been developed to perform biclustering applied to various cases. However, only a few studies have evaluated the performance of bicluster algorithms. Therefore, this study evaluates the performance of biclustering algorithms, namely the Cheng and Church algorithm (CC algorithm) and the Iterative Signature Algorithm (ISA). Evaluation of the performance of the biclustering algorithm is carried out in the form of a comparative study of biclustering results in terms of membership, characteristics, distribution of biclustering results, and performance evaluation. The performance evaluation uses two evaluation functions: the intra-bicluster and the inter-bicluster. The results show that, from an intra-bicluster evaluation perspective, the optimal bicluster group of the CC algorithm produces bicluster quality which tends to be better than the ISA. The biclustering results between the two algorithms in inter-bicluster evaluation produce a deficient level of similarity (20-31 percent). This is indicated by the differences in the results of regional membership and the characteristics of the identifying variables. The biclustering results of the CC algorithm tend to be homogeneous and have local characteristics. Meanwhile, the results of biclustering ISA tend to be heterogeneous and have global characteristics. In addition, the results of biclustering ISA are also robust.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Aliyev, Gurban, und Sakina Safiyeva. „Associative computing in algorithm theory“. Scientific Works 18, Nr. 1 (22.04.2024): 86–90. http://dx.doi.org/10.62706/bqiz.2024.v18i1.105.

Der volle Inhalt der Quelle

Annotation:

The article discusses associative calculations in the theory of algorithms. Explains associative calculations using ordered substitutions and graphical diagrams. In the theory of algorithms, the need arises for mathematical refinement of the algorithm. One of them is the regular Markov algorithm. Associative calculus is also used in the regular Markov algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Yang, Huiwei. „Application of Hybrid Encryption Algorithm in Hardware Encryption Interface Card“. Security and Communication Networks 2022 (30.05.2022): 1–11. http://dx.doi.org/10.1155/2022/7794209.

Der volle Inhalt der Quelle

Annotation:

In order to effectively solve the increasingly prominent network security problems, cryptographic algorithm is the key factor affecting the effectiveness of IPSec VPN encryption. Therefore, this paper mainly studies cryptographic algorithms and puts forward the following solutions: briefly analyze the concept and function of IPSec VPN, as well as the basic theoretical knowledge of IPSec Security Protocol and cryptography, and analyze the traditional cryptography, modern cryptography, symmetric cryptographic algorithms and asymmetric algorithms, and their security. At the same time, the executable and security performances of AES and DES algorithms are compared and analyzed. This paper studies the elliptic curve encryption algorithm ECC, expounds the mathematical basis of realizing the algorithm, and compares and analyzes the security performance and execution efficiency of ECC. Based on the above two algorithms, a hybrid encryption algorithm is proposed, and the realization mechanism of the hybrid encryption algorithm is studied and discussed. The hybrid encryption algorithm combines the advantages of ECC and AES. The algorithm selects 128-bit AES and 256-bit ECC. In order to better cover up plaintext C, AES is used to encrypt information. While enhancing security, speed is also considered. The improved encryption, decryption, and signature authentication algorithms are relatively safe and fast schemes. ECC algorithm is improved, and on this basis, ECC algorithm and AES algorithm are combined. Moreover, HMAC message authentication algorithm is added, and the performance of the improved algorithm is significantly improved.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Algorithm“

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