Algorithm

Decent Essays
Improved Essays
Superior Essays
Great Essays
Brilliant Essays
    Page 1 of 50 - About 500 Essays
  • Improved Essays

    1) Linked Cluster Algorithm (LCA) [5], [6], [7]: LCA, was one of the initial clustering algorithms evolved. It was primarily developed for wired sensors, but later applied in wireless sensor networks. In LCA, a unique ID number is allotted to each node and has two means of becoming a cluster head. The first way is that if the node has the greatest ID number in the set including all neighbor nodes and the node itself. The second way is to assume that none of its neighbors are cluster heads, then it becomes a cluster head. In this way, LCA search a solution which is surely not an optimal solution. 2) Linked Cluster Algorithm (LCA) [5], [6], [7]: LCA2 was anticipated to reduce the selection of an unnecessary number of cluster heads, as in LCA. In LCA2, the concept of a node being covered and non-covered was introduced. A node is considered as covered if one of its neighbors is a cluster head. Cluster heads are primarily selected from nodes which are having lowest ID among non-covered neighbors. Again the probability of achieving success is less. 3) Highest-Connectivity Cluster Algorithm [7]: This algorithm is analogous to LCA. In…

    • 930 Words
    • 4 Pages
    Improved Essays
  • Great Essays

    SVM And Genetic Algorithm

    • 985 Words
    • 4 Pages

    Abstract- SVM(Support vector machine) is Mainly established for linear two-class classification through building an optimal splitting hyper plane, here the margin is maximized. SVM is useful for kernel trick to map the novel input space into a high dimensional feature space to improve the classifier generalization ability when the training data is not linear splitable. GA(Genetic Algorithm) is a stochastic and the empirical searching algorithm that is stimulated by natural evolution. The…

    • 985 Words
    • 4 Pages
    Great Essays
  • Great Essays

    Traveling Salesman Problem (TSP) is one of combinatorial optimization problems. X TSP is NP-hard problem which defined as a set of cities and each city should be visited once with minimum tour length. This paper solved this problem using Firefly Algorithm (FA) and k-means clustering by three steps: cluster the nodes, finding optimal path in each cluster and connect the clusters. The first step is to divide all nodes into sub-problems using k-means clustering, the second step is to use FA to find…

    • 1438 Words
    • 6 Pages
    Great Essays
  • Superior Essays

    1  Abstract — Information sent and received in wireless communication systems can suffer from data losses due to multipath propagation, further leading to intersymbol interference. These conditions compromise the integrity of the information transmitted. This paper explores the Viterbi algorithm used to combat error bounds in convolutional codes, and develops a MATLAB-based alternative model of the algorithm for continuous time applications that is shown to significantly diminish the effects of…

    • 884 Words
    • 4 Pages
    Superior Essays
  • Improved Essays

    PSO Case Study

    • 1107 Words
    • 5 Pages

    • PSO Algorithm to generate test cases A. Initialize the population with N Particles where Program will search for optimal solution through the movement of these particles. And Set iterations counter I = 0. B. Apply Fitness function: Calculating the fitness value by calculating the percentage of this particle will share in minimizing the total processing time to find the optimal solution. C. Compare the calculated fitness value of each particle with its (lbest). If current value is better…

    • 1107 Words
    • 5 Pages
    Improved Essays
  • Improved Essays

    A COMPARITIVE STUDY OF NEAREST NEIGHBOUR ALGORITHM AND GENETIC ALGORITHM IN SOLVING TRAVELLING SALESMAN PROBLEM Ajaz Ahmed Khan Electronics and communication department SSGI FET Bhilai, India ajz70277@gmail.com Mrs. Himani Agrawal Electronics and communication department SSGI FET Bhilai, India Abstract—In this paper, we have used two algorithms, i.e. the Nearest Neighbor algorithm and Genetic Algorithm to solve the Travelling Salesman problem. The Travelling Salesman…

    • 1906 Words
    • 8 Pages
    Improved Essays
  • Great Essays

    Bingo Algorithm

    • 1296 Words
    • 6 Pages

    On October 24, I taught a math lesson about subtracting using the traditional algorithm, to Mrs. Beach’s fourth grade class. When teaching the lesson, I felt very nervous because I did not think that I was teaching the material in the most comprehensive manner. After reflecting on why I felt this way, I think it was because I combined the modeling/direct instruction with the guided practice. I did not mean to do this on purpose, but I think it happened because I was worried about teaching…

    • 1296 Words
    • 6 Pages
    Great Essays
  • Superior Essays

    Psychology will help me make an impact on the world. By utilizing the principles of psychology I’ll be able to create AI capable of mimicking human-level intelligence, learning, and memory. Additionally, the principles of psychology will help in the creation of AI capable of devising algorithms to best appropriate natural resources, create better forms of government, and increase the quality of life for the people of the world. Thus bringing the dream of an ideal society to reality. In…

    • 1162 Words
    • 5 Pages
    Superior Essays
  • Improved Essays

    from technological progressions. One such ramification is the emergence of racism within the algorithms that dictate and govern…

    • 754 Words
    • 4 Pages
    Improved Essays
  • Superior Essays

    in Computational Physics, but a car accident forced me to focus on my recovery for several months so I never participated in that program. Afterward, I worked as Algorithm optimizer and back-end developer in some companies(listed in my CV). In one of the companies, my responsibility was to optimize their current algorithms. The company was a hardware firewall provider. Upon my investigations, I came to the understanding that their parallelization was not effective at all. In a standard test of…

    • 1089 Words
    • 5 Pages
    Superior Essays
  • Previous
    Page 1 2 3 4 5 6 7 8 9 50