中国开放科研知识云: 检索

验证码:

换一张

忘记密码？记住我

取消登录

CORC

首页
科研机构
检索
知识图谱
申请加入
托管服务

在结果中检索

科研机构

数学与系统科学研究院 [5]

西安交通大学 [2]

清华大学 [1]

北京大学 [1]

北京航空航天大学 [1]

兰州大学 [1]

内容类型

期刊论文 [11]

会议论文 [2]

发表日期

学科主题

radio syst... [1]

知识图谱

CORC

已提交作品

待认领作品

已认领作品

未提交全文

浏览/检索结果: 共13条，第1-10条

帮助

已选(0)清除条数/页：排序方式：
	QoS-based web service selection for multiple users by genetic algorithm 会议论文 ICNC-FSKD 2018 - 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, 2018-07-28 作者: Zhu, W.; Qin, H.; Wang, J.; Cai, K.-Y. 收藏 \| 浏览/下载：10/0 \| 提交时间：2019/12/30 Fuzzy systems Genetic algorithms Optimal systems Pareto principle Polynomial approximation Quality of service Websites A^2-FPTAS Fully polynomial time approximation schemes Multiple user Optimal solutions Pareto optimal solutions Service oriented application Service selection Web service selection Web services
	Filtering and smoothing formulas of AR(p)-modulated Poisson processes 期刊论文 Communications in Statistics: Simulation and Computation, 2018 作者: Duan, Qihong; Liu, Junrong 收藏 \| 浏览/下载：9/0 \| 提交时间：2019/11/26 Auto-regression models Closed-form expression Computational issues Partial fraction decomposition Poisson observation Polynomial-time algorithms Rational polynomial Reference probability
	Approximation for the minimum cost doubly resolving set problem 期刊论文 THEORETICAL COMPUTER SCIENCE, 2016, 卷号: 609, 页码: 526-543 作者: Chen, Xujin; Hu, Xiaodong; Wang, Changjun 收藏 \| 浏览/下载：15/0 \| 提交时间：2018/07/30 Source location Doubly resolving set Approximation algorithms Polynomial-time solvability Metric dimension
	The clique-transversal set problem in claw-free graphs with degree at most 4 期刊论文 INFORMATION PROCESSING LETTERS, 2015, 卷号: 115, 页码: 331-335 作者: Liang, Zuosong[1]; Shan, Erfang[2] 收藏 \| 浏览/下载：4/0 \| 提交时间：2019/04/26 Graph algorithms Clique Clique-transversal set problem Polynomial time algorithm Claw-free graph
	Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data 期刊论文 ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 1, 页码: 1-26 作者: AlvarezMiranda Eduardo; CandiaVejar Alfredo; Chen Xujin; Hu Xiaodong; Li Bi 收藏 \| 浏览/下载：2/0 \| 提交时间：2021/01/14 SERIES-PARALLEL GRAPHS SHORTEST-PATH PROBLEM COMPUTATIONAL-COMPLEXITY NETWORK OPTIMIZATION CONSTRAINTS ALGORITHMS FLOWS uncertainty modeling prize collecting Steiner tree interval data series-parallel graphs polynomial-time solvability
	Feedback vertex sets on restricted bipartite graphs 期刊论文理论计算机科学, 2013 Jiang, Wei; Liu, Tian; Wang, Chaoyi; Xu, Ke 收藏 \| 浏览/下载：4/0 \| 提交时间：2015/11/10 Feedback vertex set Tree convex bipartite Polynomial time N P-complete APPROXIMATION ALGORITHMS ROTATOR GRAPHS BUTTERFLIES HYPERGRAPHS MESHES BOUNDS
	Fault diagnosis of complex system based on nonlinear spectrum and kernel principal component analysis 期刊论文 Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2012, 卷号: 29, 期号: [db:dc_citation_issue], 页码: 1558-1564 作者: Zhang, Jia-Liang; Cao, Jian-Fu; Gao, Feng; Han, Hai-Tao 收藏 \| 浏览/下载：3/0 \| 提交时间：2019/12/10 Data dimensions Diagnosis of complex systems Fault detection and identification Frequency spectra Generalized frequency response functions Identification rates Kernel function Kernel principal component Kernel principal component analyses (KPCA) Least squares support vector machines Least-squares algorithms Local characteristics Mixed kernel function Multi-classification Nonlinear analog circuits Nonlinear characteristics Nonlinear frequency Nonlinear spectrum On-line diagnosing Polynomial functions Radial basis functions Servo-drive systems Spectrum features Time domain Volterra kernels
	Deterministic risk control for cost-effective network connections 期刊论文 THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 3, 页码: 257-264 作者: Alvarez-Miranda, Eduardo; Chen, Xujin; Hu, Jie; Hu, Xiaodong; Candia-Vejar, Alfredo 收藏 \| 浏览/下载：7/0 \| 提交时间：2018/07/30 Polynomial time algorithms Interval data Network design
	Settling the complexity of computing two-player Nash equilibria 期刊论文 2010, 2010 Xi Chen; Xiaotie Deng; Shang-hua Teng 收藏 \| 浏览/下载：2/0
	A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks 会议论文 IEEE INFOCOM 2010, San Diego, CA, United states, March 14, 2010 - March 19, 2010 作者: Kim, Donghyun; Wang, Wei; Li, Xianyue; Zhang, Zhao; Wu, Weili 收藏 \| 浏览/下载：3/0 \| 提交时间：2017/01/20 Approximation algorithms Computation theory Polynomial approximation Wireless networks Approximation ratios CdS Connected Dominating Set Constant factor approximation Dominating sets Feasible solution K-connected Polynomial time approximation algorithms Quality fault Unit disk graphs

相关链接
欧盟学术资源开放存取平台
CALIS高校机构知识库
台湾学术机构典藏
香港机构知识库整合系统
中国科学院机构知识库网格系统

CORC
关于我们
服务条款
隐私条款

联系我们
0931-8270076
cspace@llas.ac.cn
China-OR

中文简体

©版权所有 ©2017 CSpace - Powered by CSpace