Performance limitations of parallel simulations.
Performance modeling tools with applications.
Performance of multichannel multiaccess protocols with receiver collisions
Periodic Orbits for Additive Cellular Automata.
Periodic sorting using minimum delay, recursively constructed merging networks.
Periodicity and roots of transfinite strings
This contribution extends the notions of roots and periodicity to strings of transfinite lengths. It shows that given a transfinite string, either it possesses a unique root or the set of its roots are equivalent in a strong way.
Periodicity and roots of transfinite strings
This contribution extends the notions of roots and periodicity to strings of transfinite lengths. It shows that given a transfinite string, either it possesses a unique root or the set of its roots are equivalent in a strong way.
Periodicity problem of substitutions over ternary alphabets
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Periodicity Problem of Substitutions over Ternary Alphabets
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Permanents, Pfaffian orientations, and even directed circuits.
Permissive strategies : from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding...
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Permutation of sparse matrices to a specific lower BFT using graph decompositions.
Permutations avoiding two patterns of length three.
Perona-Malik equation: properties of explicit finite volume scheme
The Perona–Malik nonlinear parabolic problem, which is widely used in image processing, is investigated in this paper from the numerical point of view. An explicit finite volume numerical scheme for this problem is presented and consistency property is proved.
Persistency in the Traveling Salesman Problem on Halin graphs
For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition , , of the edge set E, where: = e ∈ E, e belongs to all optimum solutions, = e ∈ E, e does not belong to any optimum solution and = e ∈ E, e belongs to some but not to all optimum solutions.
Phenotype space and kinship assignment for the Simpson index
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...
Phenotype space and kinship assignment for the simpson index
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...
Phenotypic evolution with a mutation based on symmetric α-stable distributions
Multidimensional Symmetric α-Stable (SαS) mutations are applied to phenotypic evolutionary algorithms. Such mutations are characterized by non-spherical symmetry for α<2 and the fact that the most probable distance of mutated points is not in a close neighborhood of the origin, but at a certain distance from it. It is the so-called surrounding effect (Obuchowicz, 2001b; 2003b). For α=2, the SαS mutation reduces to the Gaussian one, and in the case of α=1, the Cauchy mutation is obtained. The...
Picture languages in automatic radiological palm interpretation
The paper presents a new technique for cognitive analysis and recognition of pathological wrist bone lesions. This method uses AI techniques and mathematical linguistics allowing us to automatically evaluate the structure of the said bones, based on palm radiological images. Possibilities of computer interpretation of selected images, based on the methodology of automatic medical image understanding, as introduced by the authors, were created owing to the introduction of an original relational description...