-
481
A METHODOLOGY FOR NETWORK TOPOLOGY DESIGN USING FUZZY EVALUATIONS
Published 2020“…The topology design of campus networks (CNs), a class of computer networks, is a NP-hard optimization problem. The design consists of three main steps and requires the optimization of several conflicting objectives such as minimization of cost, minimization of network delay, and minimization of maximum number of hops etc. …”
Get full text
article -
482
FAST FUZZY FORCE-DIRECTED/SIMULATED EVOLUTION METAHEURISTIC FOR MULTIOBJECTIVE VLSI CELL PLACEMENT
Published 2006“…The cell placement problem is a proven NP hard combinatorial optimization problem. The complexity of this problem increases when multiple optimization objectives are considered simultaneously. …”
Get full text
article -
483
Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs
Published 2008“…An irregular shape may be required by some systems. Hence, a genetic algorithm was proposed as a methodology to optimize the performance of fuzzy systems by mutating different regular shapes. …”
Get full text
Get full text
Get full text
Get full text
article -
484
"A Tabu Search Approach for the Design of Variable Structure Load Frequency Controller Incorporating Model Nonlinearities"
Published 2007“…The proposed method formulates the design of VSC as an optimization problem and utilizes Tabu Search Algorithm (TS) to find the optimal settings of the controller. …”
Get full text
article -
485
Power system output feedback stabilizer design via geneticalgorithms
Published 1997“…A digital simulation of the power system is then used in conjunction with the genetic algorithm to determine the output feedback gains. In the second method, the problem of selecting the output feedback gains is converted to a simple optimization problem with an eigenvalue based objective function, which is solved by a genetic algorithm. …”
Get full text
Get full text
article -
486
Digital circuit design through simulated evolution (SimE)
Published 2003“…Area, power and delay are considered in the optimization of circuits. Results obtained by SimE algorithm are compared to those obtained by genetic algorithm (GA).…”
Get full text
Get full text
article -
487
On the parameterized parallel complexity and the vertex cover problem
Published 2016Get full text
Get full text
Get full text
Get full text
conferenceObject -
488
GENETIC SCHEDULING OF TASK GRAPHS
Published 2020“…The problem of assigning tasks to processing elements as a combinatorital optimization is formulated, and a heuristic based on a genetic algorithm is presented. …”
Get full text
article -
489
HPTS: heterogeneous parallel tabu search for VLSI placement
Published 2002“…Two parallelization strategies, i.e., functional decomposition and multi-search thread strategies are integrated. The proposed algorithm is tested on the VLSI standard cell placement problem, however, the same algorithm can be used on any combinatorial optimization problem. …”
Get full text
Get full text
article -
490
A combinatorial auction‐based approach for ridesharing in a student transportation system
Published 2023“…Three meta-heuristics, namely particle swarm optimization, dragonfly algorithm, and imperialist competitive algorithm, are implemented in the proposed framework, whose performances are assessed and compared. …”
-
491
Uplink Noma in UAV-Assisted IoT Networks
Published 2022“…Given the complexity of the problem and the incomplete knowledge about the environment, the problem is divided into two subproblems: the first models the UAV trajectory and the selection of the first device in the NOMA cluster at each time slot as a Markov Decision Process, and uses Proximal Policy Optimization to solve it. The second device is then selected using a heuristic algorithm based on prioritizing devices with higher bit rate requirements and strict deadlines. …”
Get full text
Get full text
Get full text
masterThesis -
492
Second-order conic programming for data envelopment analysis models
Published 2022“…Indeed, the aforesaid method is based on mathematical optimization. This paper constructs a second-order conic optimization problem unifying several DEA models. …”
Get full text
Get full text
-
493
An innovative simulated annealing approach to the long-term hydroscheduling problem
Published 2001“…A significant reduction in the number of the objective function evaluations, and consequently less iterations are required to reach the optimal solution. The proposed algorithm has been applied successfully to solve a system with four series cascaded reservoirs. …”
Get full text
Get full text
article -
494
A linear programming approach for the weighted graph matchingproblem
Published 1993“…A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a simplex-based algorithm. …”
Get full text
Get full text
article -
495
Simulated evolution for timing and low power VLSI standard cell placement
Published 2020“…For this hard multiobjective combinatorial optimization problem, no known exact and efficient algorithms exist that guarantee finding a solution of specific or desirable quality. …”
Get full text
article -
496
Final exams scheduling for univeristies. (c2001)
Published 2001Get full text
Get full text
masterThesis -
497
A novel network-based SIS framework for improved GA performance
Published 2025“…Genetic algorithms have long been used to solve complex optimization problems by mimicking natural selection processes. …”
Get full text
Get full text
Get full text
masterThesis -
498
Scheduling and allocation in high-level synthesis using stochastic techniques
Published 2020“…Scheduling and allocation can be formulated as an optimization problem. In this work, a unique approach to scheduling and allocation problem using the genetic algorithm (GA) is described. …”
Get full text
article -
499
Robust Kalman filter and smoother for errors-in-variables model with observation outliers based on Least-Trimmed-Squares
Published 2020“…Since the LTS is combinatorial optimization problem the randomized algorithm has been proposed in order to achieve the optimal estimate. …”
Get full text
article -
500
Protein structure prediction in the 3D HP model
Published 2009“…In this paper, we present a Particle Swarm Optimization (PSO) based algorithm for predicting protein structures in the 3D HP model. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject