A solvable case of the set-partitioning problem
M. M. Sysło (1987)
Applicationes Mathematicae
Similarity:
M. M. Sysło (1987)
Applicationes Mathematicae
Similarity:
J. Topp, W. Ulatowski (1987)
Applicationes Mathematicae
Similarity:
Xiangui Zhao, Yang Zhang (2015)
Open Mathematics
Similarity:
Signature-based algorithms are efficient algorithms for computing Gröbner-Shirshov bases in commutative polynomial rings, and some noncommutative rings. In this paper, we first define skew solvable polynomial rings, which are generalizations of solvable polynomial algebras and (skew) PBW extensions. Then we present a signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings over fields.
Lucja Sobich (1970)
Applicationes Mathematicae
Similarity:
D. Arun Kumar, C. Pandu Rangan (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Anna Bartkowiak (1974)
Applicationes Mathematicae
Similarity:
Ladislav Janiga, Václav Koubek (1992)
Kybernetika
Similarity:
Wong, Pak-ken (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better...
Di Biase, Fausto, Urbanke, Rüdiger (1995)
Experimental Mathematics
Similarity: