The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
We consider μ-calculus formulas in a normal form: after a prefix of fixed-point quantifiers follows a quantifier-free expression. We are interested in the problem of evaluating (model checking) such formulas in a powerset lattice. We assume that the quantifier-free part of the expression can be any monotone function given by a black-box – we may only ask for its value for given arguments. As a first result we prove that when the lattice is fixed, the problem becomes polynomial (the assumption about...
In this paper we analyze some intrusion detection strategies
proposed in the literature and we show that they represent the
various facets of a well known formal languages problem: computing
the distance between a string x and a language L. In
particular, the main differences among the various approaches
adopted for building intrusion detection systems can be reduced to
the characteristics of the language L and to the notion of
distance adopted. As a further contribution we will also show that
from...
Currently displaying 1 –
6 of
6