Search alternatives:
testing algorithm » cosine algorithm (Expand Search)
would algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data testing » data using (Expand Search)
Showing 1 - 20 results of 417 for search '(( elements would algorithm ) OR ((( data testing algorithm ) OR ( solved using algorithm ))))', query time: 0.17s Refine Results
  1. 1
    Genetic algorithm based test data generator

    Genetic algorithm based test data generator by Hermadi, Irman

    Published 2004
    Get full text
    masterThesis
    Save to List
    Saved in:
  2. 2
    Web Applications Security Testing: Genetic Algorithms Based Test Data Generator

    Web Applications Security Testing: Genetic Algorithms Based Test Data Generator by unknown

    Published 2020
    Get full text
    masterThesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    Security testing and evaluation of cryptography algorithms. (c2003)

    Security testing and evaluation of cryptography algorithms. (c2003) by Otrok, Hady Ahmad

    Published 2003
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  6. 6
    A genetic algorithm for corrective retesting. (c1995)

    A genetic algorithm for corrective retesting. (c1995) by Fakih, Khaled A.

    Published 1995
    Subjects: Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  7. 7
    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:
  8. 8
    Automated Mutation-Based Test Data Generation: Genetic Algorithm Game-Like Approach

    Automated Mutation-Based Test Data Generation: Genetic Algorithm Game-Like Approach by unknown

    Published 2020
    Get full text
    masterThesis
    Save to List
    Saved in:
  9. 9
    Data Generation for Path Testing

    Data Generation for Path Testing by Mansour, Nashat

    Published 2004
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    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:
  12. 12
    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:
  13. 13
    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:
  14. 14
    Test Vector Decomposition Based Static Compaction Algorithms for Combinational Circuits

    Test Vector Decomposition Based Static Compaction Algorithms for Combinational Circuits by El-Maleh, Aiman H.

    Published 2003
    “…Testing system-on-chips involves applying huge amounts of test data, which is stored in the tester memory and then transferred to the chip under test during test application. …”
    Get full text
    article
    Save to List
    Saved in:
  15. 15
    Variable Selection in Data Analysis: A Synthetic Data Toolkit

    Variable Selection in Data Analysis: A Synthetic Data Toolkit by Mitra, Rohan

    Published 2024
    “…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
    Get full text
    article
    Save to List
    Saved in:
  16. 16
    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:
  17. 17
    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:
  18. 18
    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
    “…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
    Get full text
    article
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations

    Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations by Mansour, Nashat

    Published 1992
    “…Three optimization methods derived from natural sciences are considered for allocating data to multicomputer nodes. These are simulated annealing, genetic algorithms and neural networks. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:

Search Tools: