位置：成果数据库 > 期刊 > 期刊详情页
A memetic algorithm for hardware software partitioning
  • 期刊名称：Lecture Notes in Electrical Engineering
  • 时间：2012
  • 页码：129-134
  • 相关项目：超大规模集成电路布局的ell-1模优化模型及其算法研究
作者： Geng Lin|朱文兴|Jinglan Wu|
同期刊论文项目
超大规模集成电路布局的ell-1模优化模型及其算法研究
期刊论文 48 会议论文 1 获奖 1
同项目期刊论文
A GRASP algorithm for multi-objective circuit partitioning
A discrete dynamic convexized method for the max-cut problem
An analytical placer for VLSI standard cell placement
A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algo
VLSI电路划分问题的分散搜索算法
Pareto局部搜索算法的改进
A discrete dynamic convexized method for VLSI circuit partitioning
An alternating direction method for nash equilibrium of two-person games with alternating offers
A penalty function-based differential evolution algorithm for nonlinearly constrained global optimiz
An effective placer for large-scale mixed-size circuit placement
Combining clustered adaptive multi-start and discrete dynamic convexized methods for the max-cut pro
A placement flow for very large-scale mixed-size circuit placement
多维背包问题的变邻域填充函数算法
求解VLSI不可二划分布图规划问题的混合遗传算法
A method for detecting community structure in complex networks  
一种用于并行电路仿真的电路划分算法
A penalty decomposition method for the optimization problem with two $l_0$ norm constraints
求解VLSI标准单元布局问题的增强型遗传模拟退火算法
Solving the weighted MAX-SAT problem using the dynamic convexized method
A partial inexact alternating direction method for structured variational inequalities
VLSI等宽标准单元阵列布局问题的一个高效遗传算法
On a local search algorithm for the capacitated max-k-cut problem
A tabu search-based memetic algorithm for hardware/software partitioning
An augmented Lagrangian method for VLSI global placement
Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement
An efficient memetic algorithm for solving the max-bisection problem
Speeding up a memetic algorithm for the max-bisection problem
An improvement of the penalty decomposition method for sparse approximation
Nonsmooth optimization method for VLSI global placement
A proximal alternating direction method of multipliers for a minimization problem with nonconvex con
The robust constant and its applications in random global search for unconstrained global optimizati
An effective discrete dynamic convexized method for solving the winner determination problem
The placement model and its nonlinear placement solver for VLSI global placement
A heuristic algorithm for the strip packing problem
一种求解最大二等分问题的分散搜索算法
求解可分离凸优化问题的非精确混合分裂算法
最优冲突回避码的具体构造
VLSI标准单元阵列布局问题的一个高效遗传算法
码重为3和7的最优光正交码的具体构造
一种求解同时博弈Nash平衡问题的非线性Jacobi算法
A HOMOTOPY-BASED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR STRUCTURED CONVEX OPTIMIZATION＊t