-
1
Accurate multiple network alignment through context-sensitive random walk
منشور في 2015"…In this work, we propose a novel multiple network alignment algorithm based on a context-sensitive random walk model. …"
-
2
Test case generation for path coverage. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
3
-
4
-
5
A flexible genetic algorithm-fuzzy regression approach for forecasting: The case of bitumen consumption
منشور في 2019"…To show the applicability of the proposed approach, Iran’s bitumen consumption data in the period of 1991-2006 are used as a case study. Findings Production, import, export, road construction and price are considered as the input data used in the present study. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
6
C-3PA: Streaming Conformance, Confidence and Completeness in Prefix-Alignments
منشور في 2023"…This paper introduces a novel approximate streaming conformance checking algorithm that enriches prefix-alignments with confidence and completeness measures. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
-
7
-
8
Salp swarm algorithm: survey, analysis, and new applications
منشور في 2024"…The benefits of the proposed algorithms in addressing real-world issues with challenging and unknown search areas are demonstrated by the outcomes of real-world case studies. …"
احصل على النص الكامل
-
9
Incremental Genetic Algorithm
منشور في 2006"…Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. …"
احصل على النص الكامل
احصل على النص الكامل
article -
10
How can algorithms help in segmenting users and customers? A systematic review and research agenda for algorithmic customer segmentation
منشور في 2023"…Typically, studies generate four segments, although the maximum number rarely exceeds twenty, and in most cases, is less than ten. Based on these findings, we propose seven key goals and three practical implications to enhance customer segmentation research and application.…"
-
11
Natural optimization algorithms for optimal regression testing
منشور في 1997"…The present two natural optimization algorithms, namely simulated annealing and genetic algorithms, for solving this problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
12
Incremental & classical genetic algorithm. (c2001)
منشور في 2001احصل على النص الكامل
احصل على النص الكامل
masterThesis -
13
Evolutionary algorithm for predicting all-atom protein structure
منشور في 2011احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
14
Intelligent Rapidly-Exploring Random Tree Star Algorithm
منشور في 2024احصل على النص الكامل
doctoralThesis -
15
A hybrid genetic algorithm for task allocation in multicomputers
منشور في 2018"…A hybrid genetic algorithm for the task allocation problem (HGATA) in multicomputers is presented. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
16
Simulated Annealing and Genetic Algorithms for Optimal Regression Testing
منشور في 1999"…The experimental results, which include a comparison with previous algorithms, show that the simulated annealing and genetic algorithms find the optimal or near-optimal number of retests within a reasonable time. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
17
A genetic algorithm for corrective retesting. (c1995)
منشور في 1995احصل على النص الكامل
احصل على النص الكامل
masterThesis -
18
Fuzzy simulated evolution algorithm for topology design of campusnetworks
منشور في 2000"…Results show that on all test cases the simulated evolution algorithm exhibits more intelligent search of the solution subspace and was able to find better solutions than simulated annealing…"
احصل على النص الكامل
احصل على النص الكامل
article -
19
Fixed-parameter algorithms for hitting set problems. (c2006)
منشور في 2006احصل على النص الكامل
احصل على النص الكامل
masterThesis -
20
A fast exact sequential algorithm for the partial digest problem
منشور في 2016"…</p><h3>Conclusion</h3><p dir="ltr">Our algorithm is a fast tool to find the exact solution for the partial digest problem. …"