Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 1 - 20 results of 562 for search '(( elements method algorithm ) OR ((( net present algorithm ) OR ( solved using algorithm ))))', query time: 0.12s Refine Results
  1. 1

    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

    Published 1998
    “…It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. …”
    Get full text
    Get full text
    article
  2. 2
  3. 3

    An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

    Published 2017
    “…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  4. 4

    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

    Published 2002
    “…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
    Get full text
    Get full text
    Get full text
    article
  5. 5

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    Published 2018
    “…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  6. 6
  7. 7

    A method for the minimum coloring problem using genetic algorithms by Harmanani, Haidar

    Published 2006
    “…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  8. 8
  9. 9
  10. 10
  11. 11

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

    Published 2010
    “…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
    Get full text
    Get full text
    Get full text
    article
  12. 12
  13. 13
  14. 14
  15. 15

    Power-constrained system-on-a-chip test scheduling using a genetic algorithm by Harmanani, Haidar M.

    Published 2006
    “…The problem is solved using a "sessionless" scheme that minimizes the number of idle test slots. …”
    Get full text
    Get full text
    Get full text
    article
  16. 16
  17. 17
  18. 18

    A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology by Jaber, Mohammad

    Published 2020
    “…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  19. 19

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article
  20. 20