The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Genetic algorithms (GAs) are global optimization algorithms which can be used to solve different kinds of problems. However, in the situation that the size of feasible solution space is far less than that of search space, GAs may degrade to random searches. This paper presents an improved genetic algorithm, which adopts variable step-size algorithm to obtain a feasible solution, and reduce search...
For the floorplan optimization problem, a hybrid algorithm based on simulated annealing and genetic algorithm was presented. And a kind of bistructure coding was applied, which was different from the traditional method, including the module code and variable code. The B*-Tree representation [1] was embedded in floorplan, which is an efficient, flexible representation. From the theoretical analysis,...
Security requirements of security-critical real-time applications must be met in addition to satisfying timing constraints. However, conventional real-time scheduling algorithms ignore the applications' security requirements. Tao Xie, Xiao Qin et al. have proposed a security-aware scheduling strategy, or SAREC, and scheduling algorithm SAREC-EDF, which integrates security requirements into scheduling...
The VLSI building block layout (BBL) becomes a more and more important problem for VLSI physical design. In this paper, a multithread scheme for parallelizing a genetic algorithm for BBL placement optimization is presented. The parallel genetic algorithms (PGA) are realized, using sequence-pair (SP) as the representation. Parallel algorithm can be used either to speed up a problem or to achieve a...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.