A polynomial-time DNA computing solution for the Bin-Packing Problem

2009 ◽  
Vol 215 (6) ◽  
pp. 2055-2062 ◽  
Author(s):  
Carlos Alberto Alonso Sanches ◽  
Nei Yoshihiro Soma
Keyword(s):  
Polynomial Time ◽  
Dna Computing ◽  
Bin Packing ◽  
Packing Problem ◽  
Bin Packing Problem

scholarly journals Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xiyu Liu ◽  
Jie Xue
Keyword(s):  
Cluster Analysis ◽  
Time Complexity ◽  
Dna Computing ◽  
Bin Packing ◽  
Packing Problem ◽  
Spatial Cluster ◽  
Computing Technique ◽  
Bin Packing Problem ◽  
Data Points ◽  
Spatial Cluster Analysis

Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture. The purpose of this paper is to propose a technique for spatial cluster analysis based on sticker systems of DNA computing. We will adopt the Bin-Packing Problem idea and then design algorithms of sticker programming. The proposed technique has a better time complexity. In the case when only the intracluster dissimilarity is taken into account, this time complexity is polynomial in the amount of data points, which reduces the NP-completeness nature of spatial cluster analysis. The new technique provides an alternative method for traditional cluster analysis.

An improved heuristic and an exact algorithm for the 2D strip and bin packing problem

2010 ◽  
Vol 10 (1/2/3) ◽  
pp. 217 ◽  
Author(s):  
Abdelghani Bekrar ◽  
Imed Kacem ◽  
Chengbin Chu ◽  
Cherif Sadfi
Keyword(s):  
Bin Packing ◽  
Exact Algorithm ◽  
Packing Problem ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document