Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
settings » setting (Expand Search)
element » elements (Expand Search)
Showing 1 - 20 results of 717 for search '(((( data settings algorithms ) OR ( problem using algorithm ))) OR ( element method algorithm ))', query time: 0.12s Refine Results
  1. 1
    Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem

    Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem by Denis Alicic (23073484)

    Published 2025
    “…<p dir="ltr">This paper addresses the Two-Stage Capacitated Facility Location Problem (TSCFLP), a challenging optimization problem with significant applications in supply chain network design. …”
    Save to List
    Saved in:
  2. 2
    A reduced model for phase-change problems with radiation using simplified PN approximations

    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
    Save to List
    Saved in:
  3. 3
    On the periodic hierarchical Chinese postman problem

    On the periodic hierarchical Chinese postman problem by Muhammed Emre Keskin (19457413)

    Published 2021
    Save to List
    Saved in:
  4. 4
    Physical optimization algorithms for mapping data to distributed-memory multiprocessors

    Physical optimization algorithms for mapping data to distributed-memory multiprocessors by Mansour, Nashat

    Published 1992
    “…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  5. 5
    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing

    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing by Al Sadawi, Alia

    Published 2016
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  6. 6
    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain

    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain by Al Sadawi, Alia

    Published 2021
    “…The primary tool used in the data supply chain is data batch processing which requires efficient scheduling. …”
    Get full text
    article
    Save to List
    Saved in:
  7. 7
    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:
  8. 8
    Using genetic algorithms to optimize software quality estimation models

    Using genetic algorithms to optimize software quality estimation models by Azar, Danielle

    Published 2004
    “…The main contributions of this work are two evolutionary approaches to this optimization problem. In the first approach, we assume the existence of several models, and we use a genetic algorithm to combine them, and adapt them to a given data set. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    On the Optimization of Band Gaps in Periodic Waveguides

    On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  11. 11
    Topics in graph algorithms

    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
    Save to List
    Saved in:
  12. 12
    Mapping realistic data sets on parallel computers

    Mapping realistic data sets on parallel computers by Mansour, N.

    Published 1993
    “…They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  13. 13
    Brain Source Localization in the Presence of Leadfield Perturbations

    Brain Source Localization in the Presence of Leadfield Perturbations by Momin, Rabiya Nakhat

    Published 2015
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    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:
  16. 16
    Kernelization algorithms for the vertex cover problem

    Kernelization algorithms for the vertex cover problem by Abu-Khzam, Faisal N.

    Published 2017
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    Adaptive Secure Pipeline for Attacks Detection in Networks with set of Distribution Hosts

    Adaptive Secure Pipeline for Attacks Detection in Networks with set of Distribution Hosts by ALSHAMSI, SUROUR

    Published 2022
    “…In order to benefit from multiple different classifiers, and exploit their strengths, the use of ensembling algorithms arises, which combine the results of the individual classifiers into a final result to achieve greater precision and thus a better result. …”
    Get full text
    Save to List
    Saved in:
  19. 19
    A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM

    A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM by Selim, S.Z.

    Published 2020
    “…The global minimum solution of the problem is found using a simulated annealing-based algorithm. …”
    Get full text
    article
    Save to List
    Saved in:
  20. 20
    Scalable parallel algorithms for difficult combinatorial problems

    Scalable parallel algorithms for difficult combinatorial problems by Abu-Khzam, Faisal N.

    Published 2004
    “…These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:

Search Tools: