网格计算是基于网格结构的问题求解模式，它将网络上分布的计算机资源组织起来协同解决复杂的科学与工程计算问题。
Grid computing is a resulting mode based on the Grid frame. It organizes the distributed computing resources together to resolve the complicated problems of scientific and engineering computing.
讨论了逻辑函数卡诺图化简的计算机实现，提出了基于最大覆盖的问题求解方法。
According to different methods of simplifying logic function, this thesis discussed the method of simplifying Karnaugh map by using computer.
基于生化反应原理的DNA计算具有强大的并行运算能力，DNA计算机在求解np问题上存在着硅计算机无法比拟的先天的优越性。
Biochemical reaction theory based DNA computation is of the massive inherent parallelism, so compared to silicon computer, DNA computer has most superiority out and away on NP problems.
讨论了逻辑函数卡诺图化简的计算机实现，提出了基于最大覆盖的问题求解方法。
In order to simplify Karnaugh map this thesis presents a method based on the maximum coverage.
讨论了逻辑函数卡诺图化简的计算机实现，提出了基于最大覆盖的问题求解方法。
In order to simplify Karnaugh map this thesis presents a method based on the maximum coverage.
应用推荐