Loading...
Please wait, while we are loading the content...
Similar Documents
Capturing Branch-and-Bound using Shared Abstract Data-types
| Content Provider | Semantic Scholar |
|---|---|
| Author | Goodeve, Don Briggs, Robert O. Davy, J. R. |
| Copyright Year | 1996 |
| Abstract | To support the routine construction of large-scale parallel applications requires an effective mechanism of abstracting from the underlying machine. In this paper, abstraction using Shared Abstract Data-types is illustrated through a case-study of an irregular problem; the Travelling Salesman Problem. This design of a Branch and Bound algorithm to solve this problem is investigated, demonstrating the separation of algorithmic and implementation issues that the SADT approach offers. Issues in the composition of SADTs, and methods of exploiting the shared data weakness/performance tradeoff are discussed. |
| Starting Page | 119 |
| Ending Page | 134 |
| Page Count | 16 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-1-4471-1504-5_9 |
| Alternate Webpage(s) | https://doi.org/10.1007/978-1-4471-1504-5_9 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
