We propose a class of innite comatrix corings, and describe them as colimits of systems of usual comatrix corings. The innite comatrix corings of El Kaoutit and Gomez Torrecillas...
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
We introduce an approach to feature-based object recognition, using maximum a posteriori (MAP) estimation under a Markov random field (MRF) model. This approach provides an effici...
A necessary condition for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special ca...
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
—We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. Such satellites receive requests for transmission as they o...
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...