We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Road traffic incidents analysis has shown that a third of them occurs without any conflict which indicates problems with road following. In this paper a driving safety assistance ...