A Novel Heuristic Search Method for Two-Level Approximate Logic Synthesis

Author(s):  
Sanbao Su ◽  
Chen Zou ◽  
Weijiang Kong ◽  
Jie Han ◽  
Weikang Qian
2010 ◽  
Vol 4 (2) ◽  
pp. 29-36
Author(s):  
Jerzy Mikulik ◽  
Mirosław Zajdel

Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.


1986 ◽  
Vol 18 (5) ◽  
pp. 489-500 ◽  
Author(s):  
Hui-Chuan Chen ◽  
J. H. Fang

Sign in / Sign up

Export Citation Format

Share Document