CIRCLES

作品数：250被引量：107H指数：5
导出分析报告
相关领域：政治法律更多>>
相关作者：何湘君罗少茜王蔷陈则航唐纲更多>>
相关机构：湖南商学院北京师范大学苏州外国语学校广州体育学院更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划国家教育部博士点基金高等学校学科创新引智计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 主题=PACKINGx
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Packing unequal circles into a square container based on the narrow action spaces
《Science China(Information Sciences)》2018年第4期215-217,共3页Kun HE mohammed DOSH Yan JIN Shenghao ZOU 
supported by National Natural Science Foundation of China(Grant Nos.61472147,61370183,61602196,61772219);Shenzhen Science and Technology Planning Project(Grant No.JCYJ20170307154749425)
The single container packing problem consists of allocating a number of items inside one container in order to find the densest packing patterns without overlapping.As an important class of optimization problems,packi...
关键词：PCI Packing unequal circles into a square container based on the narrow action spaces PAS 
Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container被引量：3
《Science China(Information Sciences)》2013年第9期136-149,共14页HUANG WenQi FU ZhangHua XU RuChu 
The arbitrary sized circle packing problem （ACP） is concerned about how to pack a number of arbitrary sized circles into a smallest possible circular container without overlapping. As a classical NP-hard problem, AC...
关键词：PACKING tabu search global perturbation quasi-physical quasi-human 
Concrete Physics Method for Solving NP hard Problem
《Wuhan University Journal of Natural Sciences》2001年第Z1期140-146,共7页Huang Wen\|qi College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074,China Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China 
86 3National High-Tech Program of China(86 3-30 6 -0 5 -0 3-1) ;National Natural Science Foundation of China(193310 5 0 ) ;Chi
With a NP hard problem given, we may find a equivalent physical world. The rule of the changing of the physical states is simply the algorithm for solving the original NP hard problem .It is the most natural algorithm...
关键词：concrete physics algorithm NP hard problem circles packing the rule of the changing of the physical states 
Two personification strategies for solving circles packing problem被引量：13
《Science China(Technological Sciences)》1999年第6期595-602,共8页黄文奇 许如初 
Project supported by the 973 National Focus Program of China on Development of Fundamental Research, 863 National HighTech Programme of China, National Natural Science Foundation of China, and Chinese Science Foundation for National Doctoral Training.
Two personification strategies are presented, which yield a highly efficient and practical algorithm for solving one of the NP hard problems——circles packing problem on the basis of the quasi-physical algorithm. A v...
关键词：PACKING problem NP HARD HEURISTIC algorithm PERSONIFICATION METHOD quasi-physical method. 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部