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

    A genetic algorithm for testable data path synthesis by Harmanani, H.

    Published 2017
    “…The approach is formulated as an allocation problem and solved using an efficient genetic algorithm that generates cost-effective testable designs. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  2. 2

    A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

    Published 2003
    “…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
    Get full text
    Get full text
    Get full text
    article
  3. 3
  4. 4
  5. 5

    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
  6. 6

    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
  7. 7
  8. 8

    Capturing outline of fonts using genetic algorithm and splines by Sarfraz, M.

    Published 2001
    “…Hence, it is very difficult to obtain a global optima. We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. …”
    Get full text
    Get full text
    article
  9. 9

    Topics in graph algorithms by Abu-Khzam, Faisal Nabih

    Published 2003
    “…This is achieved by implementing some algorithms for the vertex cover problem, and conducting experiments on real data sets. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  10. 10

    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
  11. 11
  12. 12

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

    Published 1998
    “…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
    Get full text
    Get full text
    article
  13. 13
  14. 14
  15. 15

    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
  16. 16

    A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

    Published 2025
    “…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
    Get full text
    article
  17. 17
  18. 18

    Distributed dimension reduction algorithms for widely dispersed data by Abu-Khzam, F.N.

    Published 2002
    “…It runs in linear time and requires very little data transmission. A series of experiments is conducted to gauge how the algorithm’s emphasis on minimal data transmission affects solution quality. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  19. 19

    Allocating data to distributed-memory multiprocessors by genetic algorithms by Mansour, Nashat

    Published 2016
    “…We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. …”
    Get full text
    Get full text
    Get full text
    article
  20. 20

    Data damage assessment and recovery algorithm from malicious attacks in healthcare data sharing systems by Haraty, Ramzi A.

    Published 2016
    “…In this paper, we present an efficient data damage assessment and recovery algorithm to delete malicious transactions and recover affected transactions in a data source in a health care system based on the concept of the matrix. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article