Parallélisation d'algorithmes avec un nombre fixe de processeurs
Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée
Parallélisation sémantique
Parallelism in numerical analysis
Parallelizable algebras.
Parallelization of artificial immune systems using a massive parallel approach via modern GPUs
Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in order to create...
Parameters of bar -visibility graphs.
Parametric families of fuzzy consequence operators.
In a previous paper we explored the notion of coherent fuzzy consequence operator. Since we did not know of any example in the literature of non-coherent fuzzy consequence operator, we also showed several families of such operators. It is well-known that the operator induced by a fuzzy preorder through Zadeh's compositional rule is always a coherent fuzzy consequence operator. It is also known that the relation induced by a fuzzy consequence operator is a fuzzy preorder if such operator is coherent....
Parametric logarithmic type image processing for contrast based auto-focus in extreme lighting conditions
While most of state-of-the-art image processing techniques were built under the so-called classical linear image processing, an alternative that presents superior behavior for specific applications comes in the form of Logarithmic Type Image Processing (LTIP). This refers to mathematical models constructed for the representation and processing of gray tones images. In this paper we describe a general mathematical framework that allows extensions of these models by various means while preserving...
Pareto optimality in the kidney exchange problem
To overcome the shortage of cadaveric kidneys available for transplantation, several countries organize systematic kidney exchange programs. The kidney exchange problem can be modelled as a cooperative game between incompatible patient-donor pairs whose solutions are permutations of players representing cyclic donations. We show that the problems to decide whether a given permutation is not (weakly) Pareto optimal are NP-complete.
Parikh test sets for commutative languages
A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters.
Parity vertex colorings of binomial trees
We show for every k ≥ 1 that the binomial tree of order 3k has a vertex-coloring with 2k+1 colors such that every path contains some color odd number of times. This disproves a conjecture from [1] asserting that for every tree T the minimal number of colors in a such coloring of T is at least the vertex ranking number of T minus one.
Parity vertex colouring of graphs
A parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let χₚ(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds χ(G) ≤ χₚ(G) ≤ |V(G)|-α(G)+1, where χ(G) and α(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for trees. Namely, if T is a tree with diameter diam(T) and radius rad(T),...
Partial covers of graphs
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for every edge (u,v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the problems of...
Partial differential equations and image smoothing
Partial order with duality and consistent choice problem
Partially abelian squarefree words
Partially complemented representations of digraphs.
Partially ordered combining structures and multiple sources of knowledge evidences in rule-based expert systems