The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Abstract. The dissemination of context data across a pervasive environment has proven to be a difficult problem. Techniques using gossiping algorithms offer simplicity and flexibil...
Syarulnaziah Anawar, Lorcan Coyle, Simon Dobson, P...
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
In this paper we present an evaluation of four different 3D segmentation algorithms with respect to their performance on three different CT Data Sets. The segmentation algorithms ...