UPPER BOUND FOR THE SPEEDUP OF PARALLEL BEST-BOUND BRANCH-AND-BOUND ALGORITHMS.
被引:0
作者:
Quinn, Michael J.
论文数: 0引用数: 0
h-index: 0
机构:
Univ of New Hampshire, Durham, NH,, USA, Univ of New Hampshire, Durham, NH, USAUniv of New Hampshire, Durham, NH,, USA, Univ of New Hampshire, Durham, NH, USA
Quinn, Michael J.
[1
]
Deo, Narsingh
论文数: 0引用数: 0
h-index: 0
机构:
Univ of New Hampshire, Durham, NH,, USA, Univ of New Hampshire, Durham, NH, USAUniv of New Hampshire, Durham, NH,, USA, Univ of New Hampshire, Durham, NH, USA
Deo, Narsingh
[1
]
机构:
[1] Univ of New Hampshire, Durham, NH,, USA, Univ of New Hampshire, Durham, NH, USA
来源:
BIT (Copenhagen)
|
1986年
/
26卷
/
01期
关键词:
This work was supported by U.S. Army Research Office grant DAAG29-82-K-0107;