Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
Krzysztof Giaro, Marek Kubale, Michal Malafiejski,...
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...