We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
This paper addresses the issue of type safe algorithmic skeletons. From a theoretical perspective we contribute by: formally specifying a type system for algorithmic skeletons, an...