Search alternatives:
content algorithm » control algorithm (Expand Search), colony algorithm (Expand Search), cosine algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
element » elements (Expand Search)
content algorithm » control algorithm (Expand Search), colony algorithm (Expand Search), cosine algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
element » elements (Expand Search)
-
1
-
2
Predicting Compression Modes and Split Decisions for HEVC Video Coding Using Machine Learning Techniques
Published 2017Get full text
doctoralThesis -
3
Large language models for code completion: A systematic literature review
Published 2024“…Different techniques can achieve code completion, and recent research has focused on Deep Learning methods, particularly Large Language Models (LLMs) utilizing Transformer algorithms. …”
-
4
Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach
Published 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. …”
Get full text
Get full text
article -
5
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002Get full text
Get full text
article -
6
Optimized FPGA Implementation of PWAM-Based Control of Three—Phase Nine—Level Quasi Impedance Source Inverter
Published 2019“…Since, PWAM control algorithm is more complex than PSCPWM, FPGA based implementation for PWAM control is discussed. …”
-
7
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
Published 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. …”
Get full text
-
8
-
9
Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars
Published 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%.…”
-
10
-
11
Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV
Published 2013Get full text
doctoralThesis -
12
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
Published 2022“…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”
-
13
-
14
A novel technique for fast multiplication
Published 2020“…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
Get full text
article -
15
XBeGene: Scalable XML Documents Generator by Example Based on Real Data
Published 2012“…Inspired by the query-by-example paradigm in information retrieval, Our generator system i)allows the user to provide her own sample XML documents as input, ii) analyzes the structure, occurrence frequencies, and content distributions for each XML element in the user input documents, and iii) produces synthetic XML documents which closely concur, in both structural and content features, to the user's input data. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
16
A novel technique for fast multiplication
Published 1995“…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
Get full text
Get full text
article -
17
A new approach and faster exact methods for the maximum common subgraph problem
Published 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. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
18
-
19
The maximum common subgraph problem
Published 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.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20
A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand
Published 2023“…The solution approaches included the genetic algorithm (GA), particle swarm optimization (PSO), and the non-dominated sorting genetic algorithm (NSGA-II). …”