云南高校图书馆联盟文献共享服务平台- MINIMAL

MINIMAL: 作品数：618被引量：907H指数：13; 导出分析报告; 相关领域：医药卫生更多>>; 相关作者：曹光鲁国尧吕德峰左洪福蔡景更多>>; 相关机构：东南大学华南师范大学华中科技大学南京大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划国家教育部博士点基金中国博士后科学基金更多>>

Minimal Context-Switching Data Race Detection with Dataflow Tracking: 《Journal of Computer Science & Technology》2024年第1期211-226,共16页郑龙李洋辛杰刘海峰郑然廖小飞金海; This work is supported by the National Key Research and Development Program of China under Grant No.2023YFB4503400;the National Natural Science Foundation of China under Grant Nos.62322205,62072195,and 61825202.; Data race is one of the most important concurrent anomalies in multi-threaded programs.Emerging con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by a...; 关键词：data race satisfiability modulo theory multi-threaded program dynamic detection

PEJA:Progressive Energy-Efficient Join Processing for Sensor Networks: 《Journal of Computer Science & Technology》2008年第6期957-972,共16页赖永炫陈毅隆陈红; partly supported by the National High Technology Research and Development 863 Program of China under Grant No. 2008AA01Z133;the National Natural Science Foundation of China under Grant Nos. 60673138, 60603046;the Science Technology Research Program of MOE under Grant No. 106006, and the Program for New Century Excellent Talents in University.; Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications, the exploration of the relationship and linkage of sensing data within ...; 关键词：progressive join minimal join set in-network processing sensor network

ACO-Steiner： Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm被引量：5: 《Journal of Computer Science & Technology》2006年第1期147-152,共6页胡昱经彤冯哲洪先龙胡晓东严桂英; This work was partially supported by the National Natural Science Foundation of China （NSFC） under Grant No. 60373012, and the Specialized Research Fund for the Doctoral Program of Higher Education （SRFDP） of China under Grant No. 20050003099. Some preliminary results of this work were presented at IEEE International Conference on Communications, Circuits and Systems （ICCCAS）, Chengdu, China, 2004.; The rectilinear Steiner minimal tree （RSMT） problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP-complete. This paper presents an algorithm, called ACO-Steine...; 关键词：rectilinear Steiner minimal tree （RSMT） ROUTING physical design ant colony optimization （ACO）

A Simple Fault—Tolerant Adaptive and Minimal Routing Approach in 3—D Meshes被引量：1: 《Journal of Computer Science & Technology》2003年第1期1-13,共13页吴杰; 美国自然科学基金; In this paper we propose a sufficient condition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes. It is based on an early work of the author on minimal routing in 2-dimensional (2-D) meshes. Unlike ...

Extending the Cooper Minimal Pair Theorem: 《Journal of Computer Science & Technology》2001年第1期77-85,共9页张再跃; This reserch is supported by the National Natural Science Foundation of China (No.19971090).; In the study of cappable and noncappable properties of the recursively enumerable (r.e.) degrees, Lempp suggested a conjecture which asserts that for all r.e. degrees a and b, if a ≮ b then there exists an r.e. degr...; 关键词：recursively enumerable degree minimal pair

Intuitive Minimal Abduction in Sequent Calculi: 《Journal of Computer Science & Technology》1998年第3期209-219,共11页伊波陶先平等; Some computational issues on abduction are discussed in a framework of the first order sequent calculus. Starting from revising the meaning of 'good' abduction, a new criterion of abduction called intuitive-minimal ab...; 关键词：ABDUCTION sequent calculus ALGORITHM

Tableau Systems for Paraconsistency and Minimal Inconsistency被引量：1: 《Journal of Computer Science & Technology》1998年第2期174-188,共15页林作铨 sxx0.math.pku.edu.cn; In this paper, the sematics of a paraconsistent logic and its nonmonotonic extension by minimal inconsistency are presented first. And then signed tableaux for paraconsistelit logic and minimal tableaux for logic of...; 关键词：Tableaux logic of paradox paraconsistent logic minimal inconsistency nonmonotonic logic CIRCUMSCRIPTION

Analysis on Attribute Reduction Strategies of Rough Set被引量：47: 《Journal of Computer Science & Technology》1998年第2期189-192,F003,共5页王珏苗夺谦; Several strategies for the minimal attribute reduction with polynomial time complexity (O(nk)) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on ...; 关键词：Rough set minimal attribute reduction

An Algorithm for Determining Minimal Reduced-Coverings of Acyclic Database Schemes: 《Journal of Computer Science & Technology》1996年第4期347-355,共9页刘铁英叶新铭; This paper reports an algorithm (DTV) for deterdring the minimal reducedcovering of an acyclic database scheme over a specified subset of attributes. The output of this algorithm contains not only minimum number of a...; 关键词：Acyclic database scheme minimal reduced-covering HYPERGRAPH

A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes: 《Journal of Computer Science & Technology》1994年第3期204-214,共11页叶新铭; Acyclic databases possess several desirable properties for their design and use. Adistributed algorithm is proposed for determining a minimal cover of an alpha-, beta-,gamma-, or Berge-acyclic database scheme over a s...; 关键词：Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover HYPERGRAPH

MINIMAL