المنشورات و المؤلفات
The standard cell placement (SCP) problem is a well-studied placement problem, as it is an important step in the VLSI design process. In SCP, cells are placed on chip to optimize some objectives, such as wirelength or area. The SCP problem is solved...
Many real–world problems are modeled as global continuous optimization problems with a nonlinear objective function. Stochastic methods are used to solve these problems approximately, when solving them exactly is impractical. In this class of...
Placement is an important step in the VLSI design process, of which standard cell placement (SCP) is a well-studied problem. The four ‘pure’ major algorithms for placement include simulated annealing, quadratic placement, min-cut placement, and...
Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) are...