×
验证码:
换一张
忘记密码?
记住我
CORC
首页
科研机构
检索
知识图谱
申请加入
托管服务
登录
注册
在结果中检索
科研机构
西安交通大学 [10]
上海大学 [9]
数学与系统科学研究院 [7]
北京大学 [6]
清华大学 [5]
武汉大学 [3]
更多...
内容类型
期刊论文 [48]
会议论文 [5]
其他 [2]
学位论文 [1]
发表日期
2020 [1]
2019 [2]
2018 [4]
2017 [5]
2016 [2]
2015 [5]
更多...
学科主题
Computer S... [1]
Computer S... [1]
Mathematic... [1]
×
知识图谱
CORC
开始提交
已提交作品
待认领作品
已认领作品
未提交全文
收藏管理
QQ客服
官方微博
反馈留言
浏览/检索结果:
共56条,第1-10条
帮助
已选(
0
)
清除
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
发表日期升序
发表日期降序
作者升序
作者降序
提交时间升序
提交时间降序
题名升序
题名降序
Eigenfunction behavior and adaptive finite element approximations of nonlinear eigenvalue problems in quantum physics
期刊论文
ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, 2021, 卷号: 55, 期号: 1, 页码: 209-227
作者:
Yang, Bin
;
Zhou, Aihui
收藏
  |  
浏览/下载:10/0
  |  
提交时间:2021/04/26
Adaptive finite element approximation
complexity
convergence
nonlinear eigenvalue problem
non-polynomial behavior
unique continuation property
On the modulo degree complexity of Boolean functions
期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 818, 页码: 32-40
作者:
Li, Qian
;
Sun, Xiaoming
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2020/12/10
Boolean function
Degree complexity
Polynomial
Decision tree complexity
Hypergraph property
A correction to: on the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences
期刊论文
Designs, Codes, and Cryptography, 2019, 卷号: 87, 期号: 10, 页码: 2391-2393
作者:
Qi, Minglong*
;
Xiong, Shengwu
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2019/12/04
Linear feedback polynomial
Linear complexity
The Sidelnikov–Lempel–Cohn–Eastman sequences
Jacobsthal sums
94A55
A ROBUST INTERIOR POINT METHOD FOR COMPUTING THE ANALYTIC CENTER OF AN ILL-CONDITIONED POLYTOPE WITH ERRORS
期刊论文
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2019, 卷号: 37, 期号: 6, 页码: 843-865
作者:
Wang, Zhouhong
;
Dai, Yuhong
;
Xu, Fengmin
收藏
  |  
浏览/下载:16/0
  |  
提交时间:2020/05/24
Analytic center
Ill-conditioning
Unboundedness
Primal-dual interior point algorithm
Convergence
Polynomial complexity
Low Complexity Implementation of Unified Systolic Multipliers for NIST Pentanomials and Trinomials Over GF(2(m))
期刊论文
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2018, 卷号: 65, 期号: 8, 页码: 2455-2465
作者:
Shao, Qiliang
;
Hu, Zhenji
;
Basha, Shaik Nazeem
;
Zhang, Zhiping
;
Wu, Zhiqiang
收藏
  |  
浏览/下载:9/0
  |  
提交时间:2019/08/22
Computation-core
finite field multiplication
hybrid-size
low register-complexity
polynomial basis
systolic structure
unified structure
Deadlock and Blockage Control of Automated Manufacturing Systems with an Unreliable Resource
期刊论文
Asian Journal of Control, 2018
作者:
Luo, JianChao
;
Xing, KeYi
;
Zhou, MengChu
收藏
  |  
浏览/下载:3/0
  |  
提交时间:2019/11/26
Automated manufacturing systems
Control problems
Deadlock avoidance
Deadlock-free operations
Order policies
Petri net models
Polynomial complexity
Resource failures
Estimation of KL Divergence: Optimal Minimax Rate
期刊论文
IEEE Transactions on Information Theory, 2018, 卷号: Vol.64 No.4, 页码: 2648-2674
作者:
YuhengBu
;
ShaofengZou
;
VenugopalV.Veeravalli
;
YingbinLiang
收藏
  |  
浏览/下载:3/0
  |  
提交时间:2019/12/24
Estimation
Entropy
Upper
bound
Information
theory
Electronic
mail
Histograms
Complexity
theory
Functional
approximation
mean
squared
error
minimax
lower
bound
plug-in
estimator
polynomial
approximation
Energy-Efficient Power Allocation With Individual and Sum Power Constraints
期刊论文
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 卷号: 17, 页码: 5353-5366
作者:
He, Peter
;
Zhang, Shan
收藏
  |  
浏览/下载:6/0
  |  
提交时间:2019/12/30
Energy efficiency (EE)
exactness
geometric water-filling (GWF)
non-linear fractional optimization
polynomial computational complexity
power allocation
A new fully polynomial time approximation scheme for the interval subset sum problem
期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:
Diao, Rui
;
Liu, Ya-Feng
;
Dai, Yu-Hong
收藏
  |  
浏览/下载:23/0
  |  
提交时间:2018/07/30
Interval subset sum problem
Computational complexity
Solution structure
Fully polynomial time approximation scheme
Worst-case performance
On interdependent failure resilient multi-path routing in smart grid communication network
会议论文
作者:
Yang, Zishen
;
Kim, Donghyun
;
Wang, Wei
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2019/11/26
Complexity based
Decision problems
Multi path routing
Multipaths
NP Complete
Polynomial-time
Research problems
Smart Grid Communications
©版权所有 ©2017 CSpace - Powered by
CSpace