بدائل البحث:
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
g algorithm » rd algorithm (توسيع البحث)
element g » elements _ (توسيع البحث), clement k (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
g algorithm » rd algorithm (توسيع البحث)
element g » elements _ (توسيع البحث), clement k (توسيع البحث)
-
1
Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars
منشور في 2023"…Finally, a design equation that can predict the shear capacity of one-way BFRC-BFRP slabs was proposed based on genetic algorithm. The proposed model showed the best prediction accuracy compared to the available design codes and guidelines with a mean of predicted to experimental shear capacities (V<sub>pred</sub>/V<sub>exp</sub>) ratio of 0.97 and a coefficient of variation of 17.91%.…"
-
2
-
3
-
4
Large language models for code completion: A systematic literature review
منشور في 2024"…Different techniques can achieve code completion, and recent research has focused on Deep Learning methods, particularly Large Language Models (LLMs) utilizing Transformer algorithms. …"
-
5
Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach
منشور في 2006"…Multiple-Valued Logic (MVL) has been used in the design of a number of logic systems, including memory, multi-level data communication coding, and a number of special purpose digital processors. …"
احصل على النص الكامل
احصل على النص الكامل
article -
6
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
منشور في 2002"…Given a graph G = (V, E), a clique is a complete subgraph in G. …"
احصل على النص الكامل
احصل على النص الكامل
article -
7
-
8
Optimized FPGA Implementation of PWAM-Based Control of Three—Phase Nine—Level Quasi Impedance Source Inverter
منشور في 2019"…Since, PWAM control algorithm is more complex than PSCPWM, FPGA based implementation for PWAM control is discussed. …"
-
9
Brain Source Localization in the Presence of Leadfield Perturbations
منشور في 2015احصل على النص الكامل
doctoralThesis -
10
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
منشور في 2024"…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …"
احصل على النص الكامل
-
11
-
12
Face Recognition in Uncontrolled Indoor Environment
منشور في 2013احصل على النص الكامل
doctoralThesis -
13
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
منشور في 2022"…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …"
-
14
Assessment of static pile design methods and non-linear analysis of pile driving
منشور في 2006"…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
15
A novel technique for fast multiplication
منشور في 1995"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل
article -
16
A hybrid approach for XML similarity
منشور في 2007"…Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
17
The maximum common subgraph problem
منشور في 2017"…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
18
Localizing-ground Transmitters Using Airborne Antenna Array
منشور في 2020احصل على النص الكامل
doctoralThesis -
19
-
20
A new approach and faster exact methods for the maximum common subgraph problem
منشور في 2017"…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject