بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
-
1
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
منشور في 1998"…It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
article -
2
-
3
An evolutionary algorithm for solving the geometrically constrained site layout problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
4
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
5
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
منشور في 2018"…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
6
-
7
A method for the minimum coloring problem using genetic algorithms
منشور في 2006"…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
8
A method for test scheduling using an evolutionary approach. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
9
Topics in graph algorithms
منشور في 2003احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
10
-
11
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
منشور في 2010"…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
12
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
منشور في 2016الموضوعات: احصل على النص الكامل
doctoralThesis -
13
-
14
Holistic Design: Optimizing Mechatronic Systems Using Multi Objective Optimization
منشور في 2015احصل على النص الكامل
doctoralThesis -
15
Power-constrained system-on-a-chip test scheduling using a genetic algorithm
منشور في 2006"…The problem is solved using a "sessionless" scheme that minimizes the number of idle test slots. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
16
-
17
-
18
A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
19
A kernelization algorithm for d-Hitting Set
منشور في 2010"…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
20