位置：成果数据库 > 会议 > 会议详情页
Using implicit enumeration to solve 0 - 1 planning problem based on DNA computing
  • 所属机构名称：安徽理工大学
  • 会议名称：2009 International Conference on Artificial Intelligence and Computational Intelligence, AICI 2009
  • 成果类型：会议
  • 会场：Shanghai, China
  • 相关项目：整数规划问题的DNA计算模型研究与探索
作者： Yin, Zhixiang|Zhi, Lingying|Huang, Xiaohui|Hu, Juan|
同会议论文项目
整数规划问题的DNA计算模型研究与探索
期刊论文 53 会议论文 36
同项目会议论文
Web service composition with global constraint based on discrete particle swarm optimization
Constraint web service composition based on discrete particle swarm optimization
Three chains of DNA calculate for a category of special integer planning problem
The working operation problem on triple-stranded DNA structure model
Maximum weight clique problem based on sticker model
Molecular beacon-based DNA computing model for maximum weight clique problem
0-1 Programming problem based on sticker model
The Research of Codeword Problem in DNA Computing
Independent Global Constraints for Web Service Composition Based on GA and APN
Molecular beacon based DNA computing model for 0-1 programming problem
Quantized Consensus for Agents on Digraphs
An efficient Web service composition method based on the price-time Petri net
The New Bivariate Rational Interpolation Over The Triangular Grids
Constrains-aware web service composition optimization based on TTPN
An Improved Surface-based DNA Computing Model of Whole Error Permutation Problems
A Certain many Chinese Postmen Problems Research Based on DNA Computing Model
Cyclic codes over finite rings
The simple deterministic equivalents of fuzzy random inequality based on chance measure
Molecular beacon-based DNA computing model for maximum independent set problem
Impact of network information on the management of library e-resources
Best barycentric rational hermite interpolation
Asynchronously Dynamic Averaging Estimation with Communication Constraints
The Graph with binary rank
邮递员问题的三链DNA计算模型
Design of PID controller based on DNA computing
Plasmid DNA computing model of 0-1 programming Problem
A DNA algorithm for maximal matching problem
Dynamic Average Consensus Estimation over Stochastically Switching Network via Quantization Communic
Study on DNA Computing
Research and Application of workflow Based on DNA computing
Bivariate Barycentric Rational Hermite Interpolation
Bivariate Barycentric Rational Interpolation
Composite Barycentric Rational Interpolation with High-Accuracy
Surface-based computing model of maximum independent set problem
An optimization method for constraint web service composition based on fuzzy Petri net