COMPLEXITY

作品数：695被引量：904H指数：11
导出分析报告
相关作者：周登勇游兆永路浩项昀王炜更多>>
相关机构：清华大学中国科学院东南大学苏州大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划国家高技术研究发展计划国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 基金=国家重点基础研究发展计划x
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
On the complexity of sequentially lifting cover inequalities for the knapsack polytope被引量：1
《Science China Mathematics》2021年第1期211-220,共10页Wei-Kun Chen Yu-Hong Dai 
supported by National Natural Science Foundation of China(Grant Nos.11631013 and 11331012);the National Basic Research Program of China(Grant No.2015CB856002);the Major Project to Promote Development of Big Data from National Development and Reform Commission(Grant No.2016-999999-65-01-000696-01)。
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs.However,it is still an open question whether a sequentially lifted cover inequality can be computed in polynomia...
关键词：integer programming sequentially lifted cover inequality COMPLEXITY lifting problem 
On the Morphological Complexity of the Graptolite Tubaria in the Darriwilian(Middle Ordovician)
《Acta Geologica Sinica(English Edition)》2019年第S01期135-137,共3页MA Xuan ZHANG Yuandong 
funded by the financial support from the National Natural Science Foundation of China(Grant No.41772005);the Chinese Academy of Sciences(Grant Nos.XDB10010100,XDB26000000);the Ministry of Science and Technology of China(Grant Nos.2013FY111000,2017ZX05036-001-004);IGCP Project 653’The Onset of the Great Ordovician Biodiversification Event’.
1 Introduction As one of the major zooplanktonic organisms in the Ordovician and Silurian marine ecosystems,graptolites played a unique role in the GOBE(Great Ordovician Biodiversification Event)and underwent a consid...
关键词：COMPLEXITY GRAPTOLITE tubaria ORDOVICIAN DARRIWILIAN 
The complexity of climate reconstructions using the coexistence approach on Qinghai-Tibetan Plateau被引量：2
《Journal of Palaeogeography》2019年第1期68-77,共10页Zhi-Yong Zhang Dong-Mei Cheng Cheng-Sen Li Wan Hu Xuan-Huai Zhan Hong-Li Ji 
supported by National Natural Science Foundation of China (Grant No. 41861003);Basic Work Special Project of the National Ministry of Science and Technology of China (Grant No. 2013FY111500)
Quantifying the palaeoclimates of Qinghai–Tibetan Plateau is vital for understanding the uplift history of plateau and the evolution of Asian monsoon since Cenozoic. Recently, the Coexistence Approach(CA) has been em...
关键词：COMPLEXITY CLIMATE reconstruction COEXISTENCE approach Modern POLLEN ASSEMBLAGES Qinghai-Tibetan PLATEAU 
A Note on the Complexity of Proximal Iterative Hard Thresholding Algorithm
《Journal of the Operations Research Society of China》2015年第4期459-473,共15页Xue Zhang Xiao-Qun Zhang 
supported by the National Natural Science Foundation of China(No.91330102);973 program(No.2015CB856000).
The iterative hard thresholding(IHT)algorithm is a powerful and efficient algorithm for solving l_(0)-regularized problems and inspired many applications in sparse-approximation and image-processing fields.Recently,so...
关键词：l_(0)Regularization Iterative hard thresholding Proximal algorithm Convergence rate R-linear 
Complexity and applicability analysis among OVM, GFM and FVDM models被引量：4
《Journal of Southeast University(English Edition)》2015年第3期424-426,共3页李烨 王昊 王炜 项昀 丁浩洋 
The National Basic Research Program of China(973Program)(No.2012CB725402);the National Natural Science Foundation of China(No.51478113)
The complexity and applicability of three relative car-following models are investigated and they are the optimal velocity model （OVM）,the generalized force model （GFM） and the full velocity difference model （FVD...
关键词：CAR-FOLLOWING COMPLEXITY APPLICABILITY TRAJECTORY 
Variable partial-update NLMS algorithms with data-selective updating
《Science China(Information Sciences)》2014年第4期38-48,共11页ZHU FengChao GAO FeiFei YAO MinLi ZOU HongXing 
supported in part by National Basic Research Program of China(973)(Grant Nos.2013CB336600,2012CB316102);Beijing Natural Science Foundation(Grant No.4131003);National Natural Science Foundation of China(Grant Nos.61201187,61179004,61179005,61071222);Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions(Grant No.YETP0110);Scientific Research Foundation for the Returned Overseas Chinese Scholars,Ministry of Education;Tsinghua University Initiative Scientific Research Program(Grant Nos.20121088074,20101082055)
We note that some existing algorithms are based on the normalized least-mean square （NLMS） algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization pr...
关键词：adaptive filter NLMS algorithm date-selective partial update set-membership filtering compu-tational complexity 
Analysis of prediction performance in wavelet minimum complexity echo state network被引量：1
《The Journal of China Universities of Posts and Telecommunications》2013年第4期59-66,共8页CUI Hong-yan FENG Chen LIU Yun-jie 
supported by the National Natural Science Foundation of China (61201153);the National Basic Research Program of China (2012CB315805);the National Key Science and Technology Projects (2010ZX03004-002-02)
Echo state network （ESN） has become one of the most popular recurrent neural networks （RNN） for its good prediction performance of non-linear time series and simple training process. But several problems still pre...
关键词：wavelet minimum complexity echo state network echo state network wavelet parameter matrix practical applicability 
On Isomorphism Testing of Groups with Normal Hall Subgroups
《Journal of Computer Science & Technology》2012年第4期687-701,共15页乔友明 Jayalal Sarma M.N 唐邦晟 
supported in part by the National Natural Science Foundation of China under Grant No. 60553001;the National Basic Research 973 Program of China under Grant Nos. 2007CB807900 and 2007CB807901
A normal Hall subgroup N of a group G is a normal subgroup with its order coprime with its index. Schur- Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a set of coset repr...
关键词：group isomorphism normal Hall subgroup isomorphism testing problem complexity 
Complexity of synthesis of composite service with correctness guarantee
《Science China(Information Sciences)》2012年第3期638-649,共12页DENG Ting HUAI JinPeng WO TianYu 
supported by National Basic Research Program of China (Grant No. 2011CB302602);National Nature Science Foundation of China (Grant No. 61103031);Project of NLSDE (Grant Nos. SKLSDE-2010-ZX-01, SKLSDE-2010ZX-03)
How to compose existing web services automatically and to guarantee the correctness of the design （e.g. temporal constraints specified by temporal logic LTL, CTL or CTL＊） is an important and challenging problem in ...
关键词：business protocol composite service SYNTHESIS ENVIRONMENT branching temporal logic 
A new complexity metric for FH/SS sequences using fuzzy entropy被引量：2
《Science China(Information Sciences)》2011年第7期1491-1499,共9页CHEN XiaoJun SI JiangBo LI Zan CAI JuePing BAI BaoMing 
supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (Grant No.2010ZX03006-002-04);the National High Technology Research and Development Program of China (Grant No.2009AA01Z237);the National Natural Science Foundation of China (Grant No.61072070);the Program for New Century Excellent Talents in University of Ministry of Education of China (Grant No.NCET-07-0653);the 111 Project (Grant No.B08038);the Program for Changjiang Scholars and Innovative Research Team in University of Ministry of Education of China (Grant No.IRT0852)
This paper presents a new complexity metric to evaluate the unpredictability of a frequencyhopping/spread-spectrum （FH/SS） sequence based on fuzzy entropy （FuzzyEn）. According to the property of the FS/SS sequence...
关键词：frequency-hopping （FH） sequence fuzzy entropy （FuzzyEn） COMPLEXITY 
全选清除导出
共3页<123>
检索报告 对象比较 聚类工具 使用帮助 返回顶部