We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Abstract— We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate ou...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that...
The problem of cosegmentation consists of segmenting the same object (or objects of the same class) in two or more distinct images. Recently a number of different models have been...