Metaprogramming has many uses in large-scale computer programming.
元编程在大型计算机编程中有许多用途。
Part 2 of this series examines in more detail how to program Scheme macros and how they can make your large-scale programming tasks significantly easier.
本系列文章的第 2部分将详细介绍如何编写Scheme宏，以及如何使用这些宏来极大地简化大型编程任务。
This article gives you details on how Scheme macros are programmed and how they can make your large-scale programming tasks significantly easier.
本文详细介绍如何编写scheme宏以及它们如何显著地简化大型编程任务。
Support for Dryad (large scale, data-intensive parallel programming) (soon).
支持Dryad(大伸缩量，数据密集型的并行计算)(即将提供)。
This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management.
对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
The distributed component technology is used to deal with the large-scale programming development and the development based on component is the mainstream technology of desktop system now.
分布式组件技术一般用来处理大型的程序开发，基于组件的开发是当今桌面系统的主流技术。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed. The convergence of the algorithm is discussed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper a resolving method of multivariate dynamic programming model to mid and long term optimum operation for large scale hydropower system is studied.
本文研究一种混联水电站水库群中长期优化调度的多维动态规划模型的求解方法。
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
GLPK is a package intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP) problems.
GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(mip)以及相关问题的自由软件包。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
This paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
对于大规模的具有伪凸目标函数的二次规划问题，本文提出一种分解算法。
When used to solve the convex quadratic programming problems with super large scale of training samples(11000 training samples), the algorithm designed in this paper works better.
本文采用的方法在解决大规模训练问题（如11000个训练样本）时表现出的性能令人满意。
Intelligent method has been widely used in reactive power optimization because of its superiority in solving the large-scale nonlinear programming problem.
近年来，由于在解决大规模非线性规划问题上的优势，智能算法在电力系统无功优化问题中获得广泛应用。
In this paper, according to the property of oil-fields programming, we have advanced a method of "divided layer and decomposition and unify", which ison the problem of large-scale programming.
本文依据油田规划的特点，提出了大规模规划问题的“分层分解统一协调”方法。分析了这种方法的性质。
This formulation results in a large scale 0-1 programming problem with nonlinear objective function and linear or nonlinear constraints.
该数学表达式表现为一个具有非线性目标函数及线性与非线性约束条件的大规模0 - 1规划问题。
The efficient algorithms for large-scale linear programming problem have been attracting considerable attention from both theorists and practitioners in a variety of disciplines since 1970s.
关于大规模线性规划问题的有效求解问题一直受到人们的关注。
Based on successive unconstrained programming methods, the successive bound constrained programming algorithms for large-scale process system optimization are studied in this paper.
基于非线性约束极小化的序列无约束方法，对大规模过程系统稳态优化的序列界约束方法进行了研究。
It's a typical large-scale non-linear programming problem.
它是典型的大型多约束非线性规划问题。
Chapter seven introduces the reader to the decomposition principle and to large-scale programming.
第七章向读者介绍分解原理和大规模规划。
A set of systematic methods and rules in programming a large scale application software system has been proposed in this paper.
本文介绍了一整套大型应用软件系统的编写规则。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
应用推荐