您要查找的是不是:
- The program dependence graphs can be constructed concurrently, for each PDG is independent.This is much fit for larger programs. 在依赖图的计算中,子程序之间相对独立,可根据子程序调用图将所有子程序分组,使得同组的子程序可并发处理,可用于对大型代码的分析。
- An Improved Program Dependence Graph for Static Slicing Concurrent Programs 一种改进的用于并发程序静态切片的程序依赖图
- program dependence graph 程序依赖图
- Determination Strategy on Software Instrumentation Scope Based on Program Dependency Graph 基于程序依赖图的软件植入范围选取策略
- A dynamic program slice is obtained by recursively traversing the data and control dependence edges in the dynamic dependence graph of the program for the given test case[0,3]. 对于给定的测试用例{[0.;3];动态程序片是通过以下方式获得的:递归遍历程序动态依赖图中的数据和控制依赖边
- program dependency graph 程序依赖图
- Most graphics software programs depend on artistic skills. 大多数图形软件程序依赖艺术技能。
- The condition in which the accuracy of results from one program depend upon the accuracy of results from another ; for example, if the first program updates a file and the second uses it. 一种程序所得结果的精度取决于另一个程序所得结果精度的条件。例如,若第一个程序修改了一个文件,而第二个程序要用此文件。
- The condition in which the accuracy of results from one program depend upon the accuracy of results from another; for example, if the first program updates a file and the second uses it. 一种程序所得结果的精度取决于另一个程序所得结果精度的条件。例如,若第一个程序修改了一个文件,而第二个程序要用此文件。
- How you compile a program depends on your operating system and compiler. 如何进行编译,与具体操作系统和编译器有关。
- ADP) The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph. 无环依赖原则(ADP):在包的依赖关系图中不允许存在环。
- When dependency graph is constructed, each action can be assigned a rule for property adjustment. 当依赖关系图被构造时,每个动作都可以被赋予一个属性调整的规则。
- The dependence graphs of different subprograms can be saved independently, which is easy to be reused. 各子程序的依赖图可单独存储,便于重用。
- The dependency graph contains the dependency information between the variables in the solving problem. 依赖图中保留了求解问题中变量间的依赖信息。
- All conceptions, including Content DataModel (CDM), Data Dependency Graph (DDG) and Data Update Subgraph (DUS)are defined. 以GUI抽象描述模型为基础,本文提出了GUI内容数据的建模方法。 通过定义数据依赖图和数据更新子图记录和表现数据间的依赖关系和变化。
- The problems of over-constraint and under-constraint have been solved by using dependency graph based on the freedom analysis method. 摘要在自由度分析方法的基础上使用依赖图,解决了约束求解过程中的过约束和欠约束的处理问题。
- The accumulator set uses this information to generate an ordered set of accumulators depending on the feature dependency graph. 累加器集使用这些信息并根据特征依赖关系图来生成累加器的一个有序集合。
- A race condition is a bug that occurs when the outcome of a program depends on which of two or more threads reaches a particular block of code first. 争用条件是当程序的结果取决于两个或更多个线程中的哪一个先到达某一特定代码块时出现的一种bug。
- Upon looking at the problem closer, you can see, however, that the depth of the dependency graph tends to be shallow, and furthermore that some objects are natural endpoints. 但是,如果仔细考虑一下这个问题,就会发现依赖图的深度一般不大,而且某些对象是自然的端点。
- The direct dependency graph(DDG),direct dependency matrix(DDM),dependency relation matrix(DRM),degree of direct dependency(DDD) and minimal cover(MC) were defined. 然后定义了直接依赖图、直接依赖矩阵、直接依赖度、依赖关系矩阵和最小覆盖等概念。