-
21
A hybrid distributed test generation method using deterministic and genetic algorithms
منشور في 2017"…The algorithm is parallelized based on a cluster of workstations using the message passing interface (MPI) library. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
22
A Hybrid Intrusion Detection Model Using EGA-PSO and Improved Random Forest Method
منشور في 2022"…To deal with the data-imbalance issue, this research develops an efficient hybrid network-based IDS model (HNIDS), which is utilized using the enhanced genetic algorithm and particle swarm optimization(EGA-PSO) and improved random forest (IRF) methods. …"
-
23
Cryptocurrency Exchange Market Prediction and Analysis Using Data Mining and Artificial Intelligence
منشور في 2020"…One of the best algorithms in terms of the result is the Long Short Term Memory (LSTM) since it is based on recurrent neural networks which uses loop as a method to learn from heuristics data. …"
احصل على النص الكامل
-
24
Power-constrained system-on-a-chip test scheduling using a genetic algorithm
منشور في 2006"…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
25
Allocation and re-allocation of data in a grid using an adaptive genetic algorithm
منشور في 2006"…Allocation and re-allocation of data in a grid using an adaptive genetic algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
26
-
27
Empirical comparison of regression test selection algorithms
منشور في 2001"…The empirical results show that the five algorithms can be used for different requirements of regression testing. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
28
Metaheuristic Algorithm for State-Based Software Testing
منشور في 2018"…We formulate the testing problem as an optimization problem and use a simulated annealing (SA) metaheuristic algorithm to generate test cases as sequences of events while keeping the test suite size reasonable. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
29
-
30
-
31
Efficient Approximate Conformance Checking Using Trie Data Structures
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
-
32
A comparative study of five regression testing algorithms
منشور في 1997احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
33
-
34
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
منشور في 2022"…Moreover, the image pixels in different and more similar areas of the image are located next to one another in a group and classified using the specified thresholds. As a result, the embedding capacity in each class can increase by reducing the value of the difference between two consecutive pixels, and the distortion of the marked image can decrease after inserting the personal data using the DE method. …"
احصل على النص الكامل
-
35
-
36
A Graph Heuristic Approach for the Data Path Allocation Problem
منشور في 2022"…The algorithm is tested on various benchmarks and favorable results are reported. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
37
Intelligent Rapidly-Exploring Random Tree Star Algorithm
منشور في 2024احصل على النص الكامل
doctoralThesis -
38
A neural networks algorithm for data path synthesis
منشور في 2003"…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
39
Test case generation for path coverage. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
40
Data reductions and combinatorial bounds for improved approximation algorithms
منشور في 2016"…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article