at Google ScholarTitle data
Henrich, Dominik:
Initialization of parallel branch-and-bound algorithms.
In:
Parallel Processing for Artificial Intelligence 2. -
Amsterdam
: North-Holland
,
1994
. - pp. 131-144
. - (Machine Intelligence and Pattern Recognition
; 15
)
ISBN 9780444818379
DOI: https://doi.org/10.1016/B978-0-444-81837-9.50015-4
Related URLs
Project information
| Project title: |
Project's official title Project's id PARO No information LOADBAL No information |
|---|
Abstract in another language
Four different initialization methods for parallel Branch-and-bound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search tree. Furthermore, the fourth method offers the best efficiency of the overall algorithm when a centralized OPEN set is used. Experimental results by a PRAM simulation support these statements.
Further data
| Item Type: | Article in a book |
|---|---|
| Refereed: | Yes |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Chair Applied Computer Science III > Chair Applied Computer Science III - Univ.-Prof. Dr. Dominik Henrich |
| Result of work at the UBT: | No |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science |
| Date Deposited: | 12 Mar 2025 10:31 |
| Last Modified: | 12 Mar 2025 10:31 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/92803 |