Sciweavers

15 search results - page 1 / 3
» General iterative heuristics for VLSI multiobjective partiti...
Sort
View
ISCAS
2003
IEEE
77views Hardware» more  ISCAS 2003»
13 years 10 months ago
General iterative heuristics for VLSI multiobjective partitioning
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
EAAI
2006
189views more  EAAI 2006»
13 years 4 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
13 years 10 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
14 years 1 months ago
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both th...
Navaratnasothie Selvakkumaran, George Karypis
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
13 years 10 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah