Search alternatives:
solution algorithm » auction algorithm (Expand Search), pollination algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
deer algorithm » search algorithm (Expand Search)
element deer » elementi per (Expand Search)
solution algorithm » auction algorithm (Expand Search), pollination algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
deer algorithm » search algorithm (Expand Search)
element deer » elementi per (Expand Search)
-
1
-
2
UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data
Published 2024“…To improve the effectiveness and efficiency of the UniBFS algorithm, Redundant Features Elimination algorithm (RFE) is presented in this paper. …”
-
3
-
4
Enhanced simulated evolution algorithm for digital circuit design yielding faster execution in a larger solution space
Published 2004“…A tree data structure based circuits are evolved. Thus, a larger solution space is investigated. In addition, a new pattern based goodness measure is presented.…”
Get full text
Get full text
article -
5
-
6
Salp swarm algorithm: survey, analysis, and new applications
Published 2024“…The behavior of the species when traveling and foraging in the waters is the main source of SSA and MSSA. These two algorithms are put to test on a variety of mathematical optimization functions to see how they behave when it comes to finding the best solutions to optimization problems. …”
Get full text
-
7
Predicting Compression Modes and Split Decisions for HEVC Video Coding Using Machine Learning Techniques
Published 2017Get full text
doctoralThesis -
8
Topics in graph algorithms
Published 2003“…Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. …”
Get full text
Get full text
Get full text
masterThesis -
9
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. …”
-
10
PERF solutions for distributed query optimization. (c1999)
Published 1999Get full text
Get full text
masterThesis -
11
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
12
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
13
Solution of Fractional Differential Equations: Transform and Iterative Methods Approach
Published 2019Get full text
doctoralThesis -
14
Lightweight blockchain solutions: Taxonomy, research progress, and comprehensive review
Published 2023“…In this paper, we present a taxonomy of lightweight blockchain solutions proposed in the literature. …”
Get full text
Get full text
Get full text
Get full text
article -
15
Parallel metaheuristic algorithm for exam timetabling
Published 2010“…The purpose of this work is to present a parallel metaheuristic algorithm for producing good sub-optimal exam timetables in a reasonable time. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
16
Improvement Algorithm for Limited Space Scheduling
Published 2001“…An example illustrates the presented algorithm that generates a feasible space schedule.…”
Get full text
Get full text
article -
17
An Uncertainty Based Genetic Algorithm Approach for Project Resource Scheduling
Published 2016“…Results proofed effectiveness and outperformance of the proposed solution. The genetic algorithm was tested on several projects from the existing databases and on one new project to the validity of the approach. …”
Get full text
-
18
-
19
Dynamic Layout Planning Using a Hybrid Incremental Solution Method
Published 1999“…The resulting sequence of layouts is suboptimal in terms of the stated global objective, but the algorithm helps the layout planner explore better alternative solutions.…”
Get full text
Get full text
Get full text
article -
20
A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM
Published 2020“…In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. …”
Get full text
article