All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 21 Next

Displaying 401 – 420 of 572

Showing per page

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming

Maria Serna, Fatos Xhafa (2007)

RAIRO - Theoretical Informatics and Applications

We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are P-complete and hence cannot be efficiently solved in parallel unless P = NC. To deal with the parallel...

Parallel implementation of local thresholding in Mitrion-C

Tomasz Kryjak, Marek Gorgoń (2010)

International Journal of Applied Mathematics and Computer Science

Mitrion-C based implementations of three image processing algorithms: a look-up table operation, simple local thresholding and Sauvola's local thresholding are described. Implementation results, performance of the design and FPGA logic utilization are discussed.

Parallelization of artificial immune systems using a massive parallel approach via modern GPUs

Khun, Jiří, Šimeček, Ivan (2015)

Programs and Algorithms of Numerical Mathematics

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...

Phenotype space and kinship assignment for the Simpson index

Bruce Litow, Dmitry Konovalov (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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

Bruce Litow, Dmitry Konovalov (2007)

RAIRO - Theoretical Informatics and Applications

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

Andrzej Obuchowicz, Przemysław Prętki (2004)

International Journal of Applied Mathematics and Computer Science

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...

Polynomials over the reals in proofs of termination : from theory to practice

Salvador Lucas (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...

Polynomials over the reals in proofs of termination : from theory to practice

Salvador Lucas (2010)

RAIRO - Theoretical Informatics and Applications

This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...

Presentations of finite simple groups: a computational approach

Robert Guralnick, William M. Kantor, Martin Kassabov, Alexander Lubotzky (2011)

Journal of the European Mathematical Society

All finite simple groups of Lie type of rank n over a field of size q , with the possible exception of the Ree groups 2 G 2 ( q ) , have presentations with at most 49 relations and bit-length O ( 𝚕𝚘𝚐 n + 𝚕𝚘𝚐 q ) . Moreover, A n and S n have presentations with 3 generators; 7 relations and bit-length O ( 𝚕𝚘𝚐 n ) , while 𝚂𝙻 ( n , q ) has a presentation with 6 generators, 25 relations and bit-length O ( 𝚕𝚘𝚐 n + 𝚕𝚘𝚐 q ) .

Currently displaying 401 – 420 of 572