بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
among algorithm » colony algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
element » elements (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
among algorithm » colony algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
element » elements (توسيع البحث)
-
1
-
2
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 -
3
Capturing outline of fonts using genetic algorithm and splines
منشور في 2001"…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …"
احصل على النص الكامل
احصل على النص الكامل
article -
4
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 -
5
-
6
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
منشور في 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). …"
احصل على النص الكامل
احصل على النص الكامل
article -
7
-
8
Predicting Dropouts among a Homogeneous Population using a Data Mining Approach
منشور في 2019"…In this research, we present a novel data mining approach to predict retention among a homogeneous group of students, with similar social and cultural background, at an academic institution based in the UAE. …"
احصل على النص الكامل
-
9
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 -
10
A reduced model for phase-change problems with radiation using simplified PN approximations
منشور في 2025"…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …"
احصل على النص الكامل
article -
11
Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms
منشور في 2022"…Therefore, in this study we examined this market based on the price index of the automotive group, then optimized a portfolio of automotive companies using two methods. In the first method, the CVaR measurement was modeled by means of DEA, then Particle Swarm Optimization (PSO) and the Imperial Competitive Algorithm (ICA) were used to solve the proposed model. …"
-
12
-
13
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
منشور في 2024"…Various clustering methods are available, including K-means, hierarchical clustering, and density-based clustering. Among these, K-means is widely used for efficiently solving clustering problems. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
14
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
منشور في 1992"…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
15
Evolutionary algorithms for state justification in sequential automatic test pattern generation
منشور في 2005"…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …"
احصل على النص الكامل
article -
16
-
17
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
منشور في 2016الموضوعات: احصل على النص الكامل
doctoralThesis -
18
Brain Source Localization in the Presence of Leadfield Perturbations
منشور في 2015احصل على النص الكامل
doctoralThesis -
19
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 -
20
Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm
منشور في 2005احصل على النص الكامل
article