Scalability of branch-and-bound and adaptive integration

被引：0

作者：

Zanny, R ^{[1
]}

Kangars, K ^{[1
]}

de Doncker, E ^{[1
]}

机构：

[1] Western Michigan Univ, Dept Comp Sci, Kalamazoo, MI 49008 USA

来源：

PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS | 2001年

关键词：

branch-and-bound; adaptive integration; scalability; task refinement; parallel branch-and-bound;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We address the scability of branch-and-bound and adaptive integration methods in the common framework of task refinement strategies. Not withstanding the different nature (discrete versus continuous) of the problems solved by these algorithms, we give an analogous treatment of scalability issues for these irregular problems, including notions of inherent limitations on the scalability of problem instances, and introduc a parallel scalability metric. Assessment and validation of the metric is based on detailed test results.

引用

页码：674 / 680

页数：3