Search alternatives:
around algorithm » mould algorithm (Expand Search), rd algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 1 - 20 results of 277 for search '(( alignment network algorithm ) OR ((( data around algorithm ) OR ( solved using algorithm ))))', query time: 0.13s Refine Results
  1. 1
    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:
  2. 2
    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:
  3. 3
    Accurate multiple network alignment through context-sensitive random walk

    Accurate multiple network alignment through context-sensitive random walk by Hyundoo Jeong (3840013)

    Published 2015
    “…Until now, a number of network alignment algorithms have been proposed based on different formulations and approaches, many of them focusing on pairwise alignment. …”
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities

    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
    Save to List
    Saved in:
  8. 8
    Using Fractional Bernoulli Wavelets for Solving Fractional Diffusion Wave Equations with Initial and Boundary Conditions

    Using Fractional Bernoulli Wavelets for Solving Fractional Diffusion Wave Equations with Initial and Boundary Conditions by Sahlan, Monireh Nosrati

    Published 2021
    Get full text
    article
    Save to List
    Saved in:
  9. 9
    Adaptive Time-Varying Brain Source Localization

    Adaptive Time-Varying Brain Source Localization by Al-Momani, Sajedah A.

    Published 2019
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    A method for the minimum coloring problem using genetic algorithms

    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
    Save to List
    Saved in:
  12. 12
    Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm

    Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm by Abido, M. A.

    Published 2005
    Get full text
    article
    Save to List
    Saved in:
  13. 13
    Environmental/economic power dispatch using multiobjective evolutionary algorithms

    Environmental/economic power dispatch using multiobjective evolutionary algorithms by Abido, M.A.

    Published 2003
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  14. 14
    A method for test scheduling using an evolutionary approach. (c2000)

    A method for test scheduling using an evolutionary approach. (c2000) by Noujaim, Jad

    Published 2000
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  15. 15
    Decomposition method for solving a nonlinear business cycle model

    Decomposition method for solving a nonlinear business cycle model by Dibeh, Ghassan

    Published 2003
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  16. 16
    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†

    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
    Save to List
    Saved in:
  17. 17
    Multiobjective optimal power flow using strength Pareto evolutionary algorithm

    Multiobjective optimal power flow using strength Pareto evolutionary algorithm by Abido, M.A.

    Published 2004
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  18. 18
    Multiobjective Optimal VAR Dispatch Using Strength Pareto Evolutionary Algorithm

    Multiobjective Optimal VAR Dispatch Using Strength Pareto Evolutionary Algorithm by Abido, M.A.

    Published 2020
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  19. 19
    A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks

    A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks by Shaik, Muzibur Rehman

    Published 2007
    Get full text
    masterThesis
    Save to List
    Saved in:
  20. 20
    A matheuristic approach for solving the 2-connected dominating set problem

    A matheuristic approach for solving the 2-connected dominating set problem by Raka Jovanovic (17947838)

    Published 2019
    “…<p dir="ltr">This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). …”
    Save to List
    Saved in:

Search Tools: