NP-HARD

作品数：93被引量：190H指数：6
导出分析报告
相关领域：自动化与计算机技术理学更多>>
相关作者：陈跃曲润涛李肯立李庆华黄川更多>>
相关机构：复旦大学上海交通大学中国科学院上海大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家高技术研究发展计划国家重点基础研究发展计划上海市科学技术发展基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Journal of Computer Science & Technologyx
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Minimum Epsilon-Kernel Computation for Large-Scale Data Processing
《Journal of Computer Science & Technology》2022年第6期1398-1411,共14页Hong-Jie Guo Jian-Zhong Li Hong Gao 
the National Natural Science Foundation of China under Grant Nos.61732003,61832003,61972110 and U19A2059;the National Key Research and Development Program of China under Grant No.2019YFB2101902;the CCF-Baidu Open Fund CCF-BAIDU under Grant No.OF2021011.
Kernel is a kind of data summary which is elaborately extracted from a large dataset.Given a problem,the solution obtained from the kernel is an approximate version of the solution obtained from the whole dataset with...
关键词：approximate query processing KERNEL large-scale dataset NP-HARD 
Efficient Partitioning Method for Optimizing the Compression on Array Data
《Journal of Computer Science & Technology》2022年第5期1049-1067,共19页Shuai Han Xian-Min Liu Jian-Zhong Li 
This work was supported by the National Natural Science Foundation of China under Grant Nos.61832003 and U1811461.
Array partitioning is an important research problem in array management area,since the partitioning strategies have important influence on storage,query evaluation,and other components in array management systems.Mean...
关键词：array partitioning compression performance greedy strategy NP-HARD 
Approximation Algorithms for Steiner Connected Dominating Set
《Journal of Computer Science & Technology》2005年第5期713-716,共4页Ya-Feng Wu Yin-Long Xu Guo-Liang Chen 
国家自然科学基金，'Research on Routing and Wave length assignment in WDM All-optical Networks'
Steiner connected dominating set （SCDS） is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and know...
关键词：approximation algorithm Steiner connected dominated set graph algorithm NP-HARD 
Algorithm Based on Taboo Search and Shifting Bottleneck for Job Shop Scheduling被引量：2
《Journal of Computer Science & Technology》2004年第6期776-781,共6页Wen-QiHuang ZhiHuang 
国家重点基础研究发展计划(973计划)
In this paper, a computational effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. It is based on taboo search procedure and on the shifting bottleneck procedure us...
关键词：SCHEDULING job shop NP-HARD HEURISTIC taboo search 
Approximation Algorithm for Weighted Weak Vertex Cover被引量：5
《Journal of Computer Science & Technology》2004年第6期782-786,共5页YongZhang HongZhu 
科技部资助项目，国家自然科学基金，上海市科技发展基金
The problem of efficiently monitoring the network flow is regarded as the problem to find out the minimum weighted weak vertex cover set for a given graphG=(V,E). In this paper, we give an approximation algorithm to s...
关键词：weak vertex cover NP-HARD approximation algorithm 
A Note on Closeness between NP-Hard Sets and C=P
《Journal of Computer Science & Technology》2000年第2期194-195,共2页刘田 
the National Key Project of China!98-780-01-05
Two sets are close if their symmetric difference is a sparse set. It is shown that NP-hard sets are not C=P-close unless NP C=C=P. This improves the previous result and has implication in quantum compulation.
关键词：NP-HARD exact counting CLOSENESS quantum computation 
FCV_1: A New Fast GreedyCovering Algorithm
《Journal of Computer Science & Technology》1998年第4期369-374,共6页陈彬 洪勇 
In this paper, a new covering algorithm called FCV1 is presented. FCV1 comprises two algorithms, one of which is able to fast search for a partial rule and exclude the larg portion of negative examples, the other algo...
关键词：LEARNING NP-HARD covering algorithm 
The Minimum Feature Subset Selection Problem
《Journal of Computer Science & Technology》1997年第2期145-153,共9页陈彬 洪家荣 王亚东 
In applications of learning from examples to real-world tasks, feature subset selection is important to speed up training and to improve generalization performance. ideally, an inductive algorithm should use subset of...
关键词：Learning from examples NP-HARD greedy algorithm 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部