-
81
Scalable parallel algorithms for difficult combinatorial problems
Published 2004“…A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. …”
Get full text
Get full text
Get full text
conferenceObject -
82
Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines
Published 2015Get full text
doctoralThesis -
83
An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications
Published 2021“…The JAYA algorithm combines the survival of the fittest principle from evolutionary algorithms as well as the global optimal solution attractions of Swarm Intelligence methods. …”
Get full text
-
84
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
85
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
-
86
-
87
A genetic algorithm for corrective retesting. (c1995)
Published 1995Get full text
Get full text
masterThesis -
88
Machine vision algorithm for MCQ automatic grading – MVAAG
Published 2025Get full text
Get full text
article -
89
-
90
Swarm and Evolutionary Computation
Published 2022“…Then the harmony search algorithm iterates to look for and to develop a new solution enhanced by using neighboring heuristics. …”
Get full text
Get full text
-
91
Social spider optimization algorithm: survey and new applications
Published 2024“…One of the PSO algorithms or versions is the social spider optimization (SSO) algorithm, a simulation of the interaction between spider groups, males and females. …”
Get full text
-
92
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 -
93
Efficient methods and techniques for the open-shop scheduling problem. (c2006)
Published 2006Get full text
Get full text
masterThesis -
94
Timing driven genetic algorithm for standard-cell placement
Published 1995“…In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. At early generations, the search is biased toward solutions with superior timing characteristics. …”
Get full text
Get full text
article -
95
A new genetic algorithm approach for unit commitment
Published 1997“…In the proposed algorithm, coding the solution of the unit commitment problem is based on mixing binary and decimal representations. …”
Get full text
Get full text
article -
96
Distributed dimension reduction algorithms for widely dispersed data
Published 2002“…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 -
97
Three-phase simulated annealing algorithms for exam scheduling
Published 2003“…We decompose the problem into three phases and propose simulated annealing algorithms for these phases. Hence, we refer to our solution methods as 3-phase simulated annealing (3PSA). …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
98
Algorithmic Study of Online Multi-Facility Location Problems
Published 2022“…The latter is a worst-case analysis that compares the cost of the online algorithm to that of the optimal offline algorithm that is assumed to know all demands in advance. …”
Get full text
Get full text
Get full text
Get full text
article -
99
Optimization of Support Structures for Offshore Wind Turbines using Genetic Algorithm with Domain-Trimming (GADT)
Published 2017“…The powerful genetic algorithm optimization technique is augmented with an innovative “domain-trimming” modification. …”
Get full text
article -
100
An Algorithm For Computing The Distance Between Two Circular Disks
Published 2020“…For the case where the points are at the circumferences, the problem has no analytical solutions [IBM J. Res. Develop. 34 (5) (1990)]. Instead, we propose for the latter case an iterative algorithm based on computing the distance between a fixed point and a circle. …”
Get full text
article