Parallel algorithm

Decent Essays
Improved Essays
Superior Essays
Great Essays
Brilliant Essays
    Page 12 of 19 - About 186 Essays
  • Great Essays

    Title: Multi-Objective LPO by Fuzzy Gravitational Search Algorithm in WWER1000 Authors: M. Aghaiea,*, S.M. Mahmoudib a Engineering Department, Shahid Beheshti University, G.C, P.O. Box: 1983963113, Tehran, Iran bFaculty of Electrical and Computer Engineering, Graduate University of Advanced Technology, Kerman, Iran. Number of manuscript pages: Number of figures: Number of tables: * Corresponding author Email: M_Aghaie@sbu.ac.ir Fax: +98 21 29902546 Abstract The…

    • 1297 Words
    • 6 Pages
    Great Essays
  • Improved Essays

    Web Crawler Case Study

    • 1327 Words
    • 6 Pages

    the efficiency and relevant search it uses the page ranking algorithms. The advantage of using distributed web crawler is that it withstand against the crashing of system and any similar events. It can be used in many crawling applications. 5- Parallel crawler: The application or the system which requires implementing multiple crawlers it is important that they should run in parallel. These parallel working crawlers are referred as parallel crawler. This type of crawler needs multiple crawling…

    • 1327 Words
    • 6 Pages
    Improved Essays
  • Improved Essays

    And right for low dimens.)[1] Finally a comparison has been made between in the way the algorithm works on the CPU and GPU architecture. The amount of data used exceeds the local memory of both the cases. Table 4: Comparison of GPU and CPU[1] From these observations, it can be said that there was a linear relation between the dimensions and the time consumed. In the parallel implantation the number of operations performed were significantly smaller the combining of intermediate…

    • 971 Words
    • 4 Pages
    Improved Essays
  • Improved Essays

    Nt1330 Unit 3 Assignment 1

    • 2049 Words
    • 9 Pages

    Each zone is constructed as virtual hierarchical that are geographic -specific. Each zone has a pre-defined number of nodes and a coordinator 〖C(i)〗_11^1to these nodes. The coordinator is assigned based on the proposed IHRW hashing algorithm, as illustrated in heuristic 3. Heuristic 3: The adaptive HRW protocol proposed in figure 5 is implemented in each level of the virtual hierarchical. Suppose the system contains n_od nodes that will be divided into number of Rendezvous geographic Zones…

    • 2049 Words
    • 9 Pages
    Improved Essays
  • Improved Essays

    When applied to ELD problem, the solution produced by the algorithm is represented by the location of source of nectar while the amount of nectar represents the quality (fitness) of the solution. Employee bees fly around in search of source of nectar (representing trial in a search space) and select their preferred…

    • 1382 Words
    • 6 Pages
    Improved Essays
  • Improved Essays

    Terrain Contour Matching (TERCOM) TERCOM is an algorithm that analyses the mean absolute distance by matching the distance between the map depth and the measured depth, as explained by (Carreno, 2010). With TERCOM, the measurements from a certain profile along the trajectory are processed in batch, but it may also be run recursively. The method indirectly assumes constant position offsets from the INS position each time it is started. Point Mass Filter (PMF) PMF is a calculation that determines…

    • 709 Words
    • 3 Pages
    Improved Essays
  • Improved Essays

    sic equ eri lly. Follo la e s ur lem ̈ ( + ) − + − ̈ = 2. In the 2nd step, we start improving our Kohonen algorithm by using Computer Programming and Math softwares MATLAB and STUDIO-1. During this step, the network must be fed a large number of example vectors that represent the kinds of vectors expected during mapping. 3. In 3rd step, we was applying n-dimensional Toroidal to our algorithm. Toroidal groups play an important part in our research. That is n-dimensional Toroidal have a…

    • 1393 Words
    • 6 Pages
    Improved Essays
  • Superior Essays

    existing functionality of a component at runtime, without necessarily letting the component know of its decorators. Decorators must conform to the interface of the component that they intend to decorate. Strategy pattern – “Define a family of algorithms, encapsulate each one, and make them…

    • 1709 Words
    • 7 Pages
    Superior Essays
  • Superior Essays

    Instruction set and functional unit set are characterizing for doing Instruction scheduling. Processors are designated for performing different sets of tasks. Genetic programming has been evolved from Genetic algorithm which is used in applications for machine learning. It uses algorithms and randomly generated remainders to find the expression fitness and compiles the program. Here the important step in GP is to identify required functions and useful terminals and find a way to combine them to…

    • 814 Words
    • 4 Pages
    Superior Essays
  • Great Essays

    CHAPTER-1 INTRODUCTION OVERVIEW Multimodal biometric face and fingerprint recognition using XOR configuration system based on adaptive principal component analysis and multilayer perception. Multimodal biometric is a combination of physiological and behavioral characteristics into a single biometric system. The important cause to combine singular traits is to get improve recognition rate and accurate result. This is done when feature and trait of biometric are statistically independent. The…

    • 5539 Words
    • 23 Pages
    Great Essays
  • Page 1 9 10 11 12 13 14 15 16 19