Search alternatives:
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element » elements (Expand Search)
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element » elements (Expand Search)
-
1
A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology
Published 2020“…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …”
Get full text
Get full text
Get full text
masterThesis -
2
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Subjects: “…Genetic algorithms -- Data processing…”
Get full text
Get full text
masterThesis -
3
Web Based Online Hybrid Teaching Method of Network Music Course
Published 2022“…In the context of big data, the lengthy personalized screening process of users has become one of the problems to be solved. …”
Get full text
-
4
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
Published 2022“…Optimization algorithms are one of the most popular methods for solving NP-hard problems. …”
Get full text
-
5
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016“…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
Get full text
doctoralThesis -
6
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Subjects: “…Trees (Graph theory) -- Data processing…”
Get full text
Get full text
masterThesis -
7
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Published 2017Subjects: “…Trees (Graph theory) -- Data processing…”
Get full text
Get full text
Get full text
masterThesis -
8
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
9
Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain
Published 2021“…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
Get full text
article -
10
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
11
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
12
On the steiner walk problem. (c2009)
Published 2009Subjects: “…Euclidean algorithm -- Data processing…”
Get full text
Get full text
masterThesis -
13
-
14
-
15
A genetic algorithm for corrective retesting. (c1995)
Published 1995Subjects: Get full text
Get full text
masterThesis -
16
DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data
Published 2022Subjects: Get full text
Get full text
Get full text
masterThesis -
17
Three-phase approach for curriculum-based course timetabling problem. (c2012)
Published 2012Subjects: “…Scheduling -- Data processing…”
Get full text
Get full text
masterThesis -
18
Topics in graph algorithms
Published 2003“…This is achieved by implementing some algorithms for the vertex cover problem, and conducting experiments on real data sets. …”
Get full text
Get full text
Get full text
masterThesis -
19
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20
A fast exact sequential algorithm for the partial digest problem
Published 2016“…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …”