Search alternatives:
using algorithms » cosine algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 1 - 20 results of 857 for search '(( elements network algorithm ) OR ((( data using algorithms ) OR ( solved using algorithm ))))', query time: 0.13s Refine Results
  1. 1
    Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm

    Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm by Abu Zitar, Raed

    Published 2022
    “…Optimization algorithms are one of the most popular methods for solving NP-hard problems. …”
    Get full text
    Save to List
    Saved in:
  2. 2
    Damage assessment & recovery from malicious transactions using data dependency for deffensive information warfare. (c2006)

    Damage assessment & recovery from malicious transactions using data dependency for deffensive information warfare. (c2006) by Zeitunlian, Arda

    Published 2006
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  3. 3
    A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology

    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
    Save to List
    Saved in:
  4. 4
    Capturing outline of fonts using genetic algorithm and splines

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

    Published 2001
    “…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  5. 5
    A genetic algorithm for testable data path synthesis

    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
    Save to List
    Saved in:
  6. 6
    A neural networks algorithm for data path synthesis

    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
    Save to List
    Saved in:
  7. 7
    Design of acoustic absorbing metasurfaces using a data-driven approach

    Design of acoustic absorbing metasurfaces using a data-driven approach by Hamza Baali (14603380)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  8. 8
    Web Based Online Hybrid Teaching Method of Network Music Course

    Web Based Online Hybrid Teaching Method of Network Music Course by Abu Zitar, Raed

    Published 2022
    “…Based on Web data mining, an improved algorithm of hybrid hierarchical recommendation algorithm and genetic algorithm is used in the experiment, and compared with the other two algorithms in the experiment. …”
    Get full text
    Save to List
    Saved in:
  9. 9
    An algorithm for solving bond pricing problem

    An algorithm for solving bond pricing problem by Dibeh, Ghassan

    Published 2002
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  10. 10
    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  11. 11
    Genetic and heuristic algorithms for regrouping service sites. (c2000)

    Genetic and heuristic algorithms for regrouping service sites. (c2000) by Tabbara, Hiba

    Published 2000
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  12. 12
    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem

    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
    Save to List
    Saved in:
  13. 13
    Parallel implementation of clique partitioning using artificial neural networks. (c2000)

    Parallel implementation of clique partitioning using artificial neural networks. (c2000) by Hajj, Hisham

    Published 2000
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  14. 14
    Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms

    Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms by Abdelouahed Hamdi (14158899)

    Published 2022
    “…Therefore, in this study we examined this market based on the price index of the automotive group, then optimized a portfolio of automotive companies using two methods. In the first method, the CVaR measurement was modeled by means of DEA, then Particle Swarm Optimization (PSO) and the Imperial Competitive Algorithm (ICA) were used to solve the proposed model. …”
    Save to List
    Saved in:
  15. 15
    Topics in graph algorithms

    Topics in graph algorithms by Abu-Khzam, Faisal Nabih

    Published 2003
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  16. 16
    An evolutionary algorithm for solving the geometrically constrained site layout problem

    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
    Save to List
    Saved in:
  17. 17
    Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)

    Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) by Yassine, Mohamad M.

    Published 2017
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  18. 18
    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem

    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
    Save to List
    Saved in:
  19. 19
    Modified clarke wright algorithms for solving the realistic vehicle routing problem

    Modified clarke wright algorithms for solving the realistic vehicle routing problem by Shour, Amina

    Published 2015
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  20. 20
    Efficient Approximate Conformance Checking Using Trie Data Structures

    Efficient Approximate Conformance Checking Using Trie Data Structures by Awad, Ahmed

    Published 2021
    “…By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …”
    Get full text
    Get full text
    Get full text
    Save to List
    Saved in:

Search Tools: