Search alternatives:
would algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data presented » net presented (Expand Search)
element » elements (Expand Search)
would algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data presented » net presented (Expand Search)
element » elements (Expand Search)
-
1
A genetic algorithm for testable data path synthesis
Published 2017“…The approach is formulated as an allocation problem and solved using an efficient genetic algorithm that generates cost-effective testable designs. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
2
A neural networks algorithm for data path synthesis
Published 2003“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
3
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
4
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 -
5
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 -
6
-
7
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…Hence, it is very difficult to obtain a global optima. We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. …”
Get full text
Get full text
article -
8
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 -
9
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 -
10
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article -
11
Modified clarke wright algorithms for solving the realistic vehicle routing problem
Published 2015Get full text
Get full text
Get full text
Get full text
conferenceObject -
12
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Published 2017Get full text
Get full text
Get full text
masterThesis -
13
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
Get full text
Get full text
Get full text
article -
14
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
15
Distributed dimension reduction algorithms for widely dispersed data
Published 2002“…It runs in linear time and requires very little data transmission. A series of experiments is conducted to gauge how the algorithm’s emphasis on minimal data transmission affects solution quality. …”
Get full text
Get full text
Get full text
conferenceObject -
16
Allocating data to distributed-memory multiprocessors by genetic algorithms
Published 2016“…We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. …”
Get full text
Get full text
Get full text
article -
17
Data damage assessment and recovery algorithm from malicious attacks in healthcare data sharing systems
Published 2016“…In this paper, we present an efficient data damage assessment and recovery algorithm to delete malicious transactions and recover affected transactions in a data source in a health care system based on the concept of the matrix. …”
Get full text
Get full text
Get full text
Get full text
article -
18
-
19
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
20
Parallel physical optimization algorithms for allocating data to multicomputer nodes
Published 1994“…Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes are presented. …”
Get full text
Get full text
Get full text
article