机构

• 数学与系统科学研究院 [4]
• 自动化研究所 [3]
• 计算技术研究所 [2]
• 长春光学精密机械与物... [2]
• 软件研究所 [2]
• 理论物理研究所 [1]
• 更多

采集方式

• OAI收割 [14]
• iSwitch采集 [1]

内容类型

• 期刊论文 [12]
• 会议论文 [2]
• 学位论文 [1]

发表日期

• 2019 [1]
• 2018 [1]
• 2014 [1]
• 2011 [1]
• 2010 [2]
• 2009 [3]
• 更多

学科主题

• Computer S... [1]
• Physics [1]

筛选

浏览/检索结果: 共15条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 The Efficient Computation of Aircraft Range Problem 期刊论文  OAI收割 ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2019, 卷号: 35, 期号: 4, 页码: 862-872 作者:  Yu, Fang;  Cui, Jin-chuan   |  收藏  |  浏览/下载：18/0  |  提交时间：2020/05/24 computational complexity  efficient computation mechanism  aircraft range problem  cluster   Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem 期刊论文  OAI收割 ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2018, 卷号: 34, 期号: 3, 页码: 645-657 作者:  Yu, Fang;  Cui, Jin-chuan   |  收藏  |  浏览/下载：18/0  |  提交时间：2018/09/08 computational complexity  efficient computation mechanism  N-vehicle exploration problem  cluster   图像匹配方法及其在检索中的应用 学位论文  OAI收割 工学硕士, 中国科学院自动化研究所: 中国科学院大学, 2014 陈文龙 收藏  |  浏览/下载：56/0  |  提交时间：2015/09/02 图像匹配  仿射不变  全局特征  图像检索  计算复杂度  image matching  affine-invariant  global descriptor  image retrieval  computation complexity   Finite element approximations of nonlinear eigenvalue problems in quantum physics 期刊论文  OAI收割 COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2011, 卷号: 200, 期号: 21-22, 页码: 1846-1865 作者:  Chen, Huajie;  He, Lianhua;  Zhou, Aihui   |  收藏  |  浏览/下载：20/0  |  提交时间：2018/07/30 Adaptive computation  Convergence  Complexity  Density functional theory  Finite element  Nonlinear eigenvalue problem   A design of high-speed and low-consume parallel grouping RS code and simulation (EI CONFERENCE) 会议论文  OAI收割 2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010, August 20, 2010 - August 22, 2010, Chengdu, China Chen C.; Jin G. 收藏  |  浏览/下载：24/0  |  提交时间：2013/03/25 RS code is a linear error correction codes with better error correction capability  is widely used in different kinds of occasions for communications or data storage. But for its high difficulty of coding and decoding algorithm and low throughput  optimization RS algorithm is always studied as one of the focus in the error-correction field. A new coding method  parallel coding and decoding data into groups in lower step finite field for avoiding complex matrix iteration and Chien search computation  is proposed in this paper. It is proved that the coding and decoding throughput of the parallel grouping RS coder is increased and the hardware complexity is reduced with changeless error-correction capability from the simulation results using ModelSim SE 6.0 and synthetic results using ISE 9.11. 2010 IEEE.   A method of estimating computational complexity based on input conditions for N-vehicle problem 期刊论文  OAI收割 ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2010, 卷号: 26, 期号: 1, 页码: 1-12 作者:  Xia, Xi;  Cui, Jin-chuan   |  收藏  |  浏览/下载：18/0  |  提交时间：2018/07/30 Complexity of computation  combinatorial optimization  N-vehicle problem  permutations  inverse order   A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling 期刊论文  iSwitch采集 Concurrency and computation-practice & experience, 2009, 卷号: 21, 期号: 16, 页码: 2070-2083 作者:  He, Jing;  Zhang, Yanchun;  Huang, Guangyan;  Pang, Chaoyi 收藏  |  浏览/下载：27/0  |  提交时间：2019/05/10 Scientific workflow  Computation time model  Dataflow  Control-flow  Algorithm complexity   A dominance tree and its application in evolutionary multi-objective optimization 期刊论文  OAI收割 INFORMATION SCIENCES, 2009, 卷号: 179, 期号: 20, 页码: 3540-3560 作者:  Shi, Chuan;  Yan, Zhenyu;  Lue, Kevin;  Shi, Zhongzhi;  Wang, Bai   |  收藏  |  浏览/下载：21/0  |  提交时间：2019/12/16 Evolutionary multi-objective optimization  Evolutionary computation  Pareto dominance  Fitness assignment  Computational complexity   Blind channel estimation of MIMO-OFDM based on FDPM (EI CONFERENCE) 会议论文  OAI收割 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009, September 24, 2009 - September 26, 2009, Beijing, China Gang W.; Ming Z.; Hua C. 收藏  |  浏览/下载：18/0  |  提交时间：2013/03/25 Subspace based methods have been widely discussed in multichannel estimation including MIMO-OFDM system. However  direct subspace methods suffer from heavy computation complexity y of O(N3). In this paper  a new subspace tracking technique called Fast Data Projection Method (FDPM) is proposed for adaptively tracking the noise subspace. The new algorithm has low complexity of O(NL) and is the only numerically stable  low complexity algorithm for tracking subspaces corresponding to the smallest singular values. Simulation results show that the proposed scheme has similar performance to the original. 2009 IEEE.   an algebraic framework for schema matching 期刊论文  OAI收割 INFORMATICA, 2008, 卷号: 19, 期号: 3, 页码: 421-446 Zhang Zhi; Shi Pengfei; Che Haoyang; Gu Jun   |  收藏  |  浏览/下载：12/0  |  提交时间：2011/06/10 schema matching  schema homomorphism  schema isomorphism  graph homomorphism  labeled graph matching  computation complexity