期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Concurrent Manipulation of Expanded AVL Trees 认领 引用
1
作者 章寅 许卓群 《Journal of Computer Science & Technology》 SCIE EI 1998年第4期325-336,共12页
The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The presented system can support any number of concurrent processes which perform searching, insertion and deletion on the t... The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The presented system can support any number of concurrent processes which perform searching, insertion and deletion on the tree. Simulation results indicate the high performance of the system. Elaborate techniques are used to achieve such a system unawilable based on any known algorithms. Methods developed in this paper may provide new insights into other problems in the area of concurrent search structure manipulation. 展开更多
关键词 AVL tree data structure binary search tree concurrent algorithm,concurrency control locking protocol
暂未订购 下载PDF
Approximation for Knapsack Problemswith Multiple Constraints 认领 引用
2
作者 张立昂 章寅 《Journal of Computer Science & Technology》 SCIE EI 1999年第4期289-297,共9页
in this paper, the approximation for four kinds of knapsack prob- lems with multiple constraints is studied: 0/1 Multiple Constraint Knapsack Problem(0/1 MCKP), Integer Multiple Constraint Knapsack Problem (Integer MC... in this paper, the approximation for four kinds of knapsack prob- lems with multiple constraints is studied: 0/1 Multiple Constraint Knapsack Problem(0/1 MCKP), Integer Multiple Constraint Knapsack Problem (Integer MCKP), 0/1k-Constraillt Knapsack Problem (0/1 k-CKP) and Integer k-Constraint KnapsackProblem (Integer k-CKP). The following results are obtained:1) Unless NP = co - R, no polynomial time algorithm approximates 0/1 MCKPor Integer MCKP within a factor k(1/2)- for any > 0; unless NP = P, nopolynomial time algorithm approximates 0/1 MCKP or integer MCKP within afactor k(1/4)- for any > 0, where k stands for the number of constraints.2) For any fixed positive integer k, 0/1 k-CKP has a fully polynomial time approximation scheme (FPTAS).3) For any fixed positive integer k, Integer k-CKP has a fast FPTAS which hastime complexity O(n +) and space complexity O(n + (1/3)), andfinds an approximate solution to within 5 of the optimal solution. 展开更多
关键词 knapsack problem approximation algorithm FPTAS
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈