Fuzzy simulated evolution algorithm for VLSI cell placement by Sait, Sadiq M.

“…There has not been a consensus on how to accommodate all these (conflicting) requirements in the search for near optimal feasible solutions. In this paper, we present a fuzzy simulated evolution (FSE) algorithm to tackle this problem. …”
Get full text

Algorithmic Study of Online Multi-Facility Location Problems by Markarian, Christine

“…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

Timing driven genetic algorithm for standard-cell placement by Sait, Sadiq M.

“…As the algorithm starts converging toward generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and routability. …”
Get full text
Get full text

An Algorithm For Computing The Distance Between Two Circular Disks by Almohamad, H.A.

“…This paper presents an algorithm for computing the distance between two circular disks in three-dimensional space. …”
Get full text

Distributed dimension reduction algorithms for widely dispersed data by Abu-Khzam, F.N.

“…Classical techniques offer optimality but are much too slow for extremely large databases. …”
Get full text
Get full text
Get full text

Environmental/economic power dispatch using multiobjective evolutionary algorithms by Abido, M.A.

“…A hierarchical clustering algorithm is also imposed to provide the decision maker with a representative and manageable Pareto-optimal set. …”
Get full text
Get full text

Invariant Solutions of the Wave Equation on Static Spherically Symmetric Spacetimes Admitting G7 Isometry Algebra by Hassan Azad (14150850)

“…<div><p>Algorithms to construct the optimal systems of dimension of at most three of Lie algebras are given. …”

A FUZZY EVOLUTIONARY ALGORITHM FOR TOPOLOGY DESIGN OF CAMPUS NETWORKS by Youssef, H.

“…ABSTRACT The topology design of campus networks is a hard constrained combinatorial optimization problem. It consists of deciding the number, type, and location of the active network elements (nodes), and the links. …”
Get full text

Simulated evolution algorithm for multiobjective VLSI netlist bi-partitioning by Sait, Sadiq M.

“…In this paper the Simulated Evolution algorithm (SimE) is engineered to solve the optimization problem of multi-objective VLSI netlist bi-partitioning. …”
Get full text
Get full text

A simulated annealing algorithm for the capacitated vehicle routing problem by Azar, Danielle

“…The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. …”
Get full text
Get full text
Get full text

A simulated annealing algorithm for the capacitated vehicle routing problem by Azar, Danielle

“…The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. …”
Get full text
Get full text
Get full text

Genetic Algorithm Based Simultaneous Eigenvalue Placement Of Power Systems by Abdel Magid, Y.L.

“…The task of selecting the output feedback gains is converted to a simple optimization problem with an eigenvaluebased objective function, which is solved by a genetic algorithm. …”
Get full text

A Survey of Machine Learning Innovations in Ambulance Services: Allocation, Routing, and Demand Estimation by Reem Tluli (22282702)

Subjects:

Design of acoustic absorbing metasurfaces using a data-driven approach by Hamza Baali (14603380)

Subjects:

A method for test scheduling using an evolutionary approach. (c2000) by Noujaim, Jad

Get full text
Get full text

An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

“…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

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

“…This work aims to enhance the performance of the K-means algorithm by introducing a novel method for selecting the initial centroids, thereby minimizing randomness and reducing the number of iterations needed to reach optimal results. …”
Get full text
Get full text
Get full text

Concurrent BIST Synthesis and Test Scheduling Using Genetic Algorithms by Harmanani, H. M.

“…The method is based on a genetic algorithm that efficiently explores the testable design space and finds a sub-optimal test registers assignment for each k-test session. …”
Get full text
Get full text
Get full text

Parallel scatter search algorithms for exam timetabling. (c2009) by Haidar, Ghia Abdullah Sleiman

Get full text
Get full text

An Anchor-Based Localization in Underwater Wireless Sensor Networks for Industrial Oil Pipeline Monitoring by Nitin Goyal (7876730)

“…This estimated distance is further optimized to minimize the estimation error. A multilateralism procedure is used to estimate the optimal position of each TN. …”