提出了一种求解二次分配问题的模拟退火蚁群算法。
A simulated annealing ant colony algorithm is presented to tackle the Quadratic Assignment Problem (QAP).
用户也许能够跟踪日志的增长过程，或者在二次日志分配中寻找增长，这可能指示数据库中一些即将出现的空间问题。
You might be able to track log growth or look for an increase in secondary log allocations, which might indicate some impending space issues in the database.
针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
最后提出改进了的分配问题的二次规划解法。
最后提出改进了的分配问题的二次规划解法。
应用推荐