English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we present an efficient parallelization of the dynamicpro gramming applied to bi-knapsack problem, in distributed memory machines(MMD). Our approach develops the tiling technique in order to control the grain parallelism and find the optimal granularity. Our proposed approach has been intensively validated on the Intel Paragon and IBM/SP2 using NX and MPI libraries. The experimental results show a linear acceleration, which enables to solve huge instances of the hardest known 0/1 bi-knapsack problems in a very reasonable time.

Solving Bi-knapsack Problem Using Tiling Approach for Dynamic Programming