بدائل البحث:
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
n algorithm » _ algorithms (توسيع البحث), rd algorithm (توسيع البحث)
present n » present _ (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
n algorithm » _ algorithms (توسيع البحث), rd algorithm (توسيع البحث)
present n » present _ (توسيع البحث)
-
1
Intelligent Rapidly-Exploring Random Tree Star Algorithm
منشور في 2024احصل على النص الكامل
doctoralThesis -
2
-
3
Efficient O(n) BIST algorithms for DDNPS faults in dual portmemories
منشور في 2020"…New fault models for both the memory array and the address decoders are proposed and efficient O(n) test algorithms are presented. The new fault models account for the simultaneous dual access property of the device. …"
احصل على النص الكامل
احصل على النص الكامل
article -
4
-
5
Variable Selection in Data Analysis: A Synthetic Data Toolkit
منشور في 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). …"
احصل على النص الكامل
article -
6
CNN and HEVC Video Coding Features for Static Video Summarization
منشور في 2022احصل على النص الكامل
article -
7
-
8
-
9
New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
منشور في 2002"…We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
10
-
11
UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data
منشور في 2024"…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …"
-
12
Auto-indexing Arabic texts based on association rule data mining. (c2015)
منشور في 2015"…Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
13
-
14
-
15
-
16
-
17
An exact algorithm for connected red–blue dominating set
منشور في 2011"…Combining exhaustive enumeration when |B| is small with the Weighted Steiner Tree approach when |B| is large, solves the problem in O⁎(n1.4143). In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
18
Distributed dimension reduction algorithms for widely dispersed data
منشور في 2002احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
19
A direct algorithm for the parameterized face cover problem
منشور في 2017"…The main contribution of this paper is a direct and relatively simple O(5kn) face cover branching algorithm. A direct O(n2) face cover kernelization algorithm is also presented.…"
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
20