-
501
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 -
502
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 -
503
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 -
504
Cooperative clustering models for Vehicular ad hoc networks. (c2013)
Published 2013Get full text
Get full text
masterThesis -
505
Final exams scheduling for univeristies. (c2001)
Published 2001Get full text
Get full text
masterThesis -
506
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 -
507
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 -
508
Data Generation for Path Testing
Published 2004“…These algorithms are based on an optimization formulation of the path testing problem which include both integer- and real-value test cases. …”
Get full text
Get full text
Get full text
article -
509
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 -
510
Evacuation of a highly congested urban city
Published 2017“…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …”
Get full text
Get full text
Get full text
conferenceObject -
511
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
Published 2020“…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
article -
512
Genetic Fuzzimetric Technique (GFT)
Published 2012“…Integration of fuzzy systems with genetic algorithm has been identified by researchers as a useful technique of optimizing systems under uncertainty. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
513
Query acceleration in distributed database systems
Published 2001“…Many techniques and algorithms have been proposed to optimize queries. Perhaps one of the more important algorithms is the AHY algorithm using semi-joins that is implemented by Apers, Hevner and Yao in [1]. …”
Get full text
Get full text
Get full text
article -
514
-
515
Fast force-directed/simulated evolution hybrid for multiobjective VLSI cell placement
Published 2004“…VLSI standard cell placement is a hard optimization problem, which is further complicated with new issues such as power dissipation and performance. …”
Get full text
Get full text
article -
516
Localization of Damages in Plain And Riveted Aluminium Specimens using Lamb Waves
Published 2018“…The genetic optimization (GO) method is used to further refine the location of damage within the enclosed area obtained using astroid algorithm. …”
Get full text
-
517
-
518
Finite state machine state assignment for area and power minimization
Published 2006“…The objectives are targeted as single/independent as well as multi-objective optimization (MOP) problems. Methods for estimating area and power of an FSM are presented. …”
Get full text
Get full text
article -
519
-
520
