Luděk Cienciala
Research Subjects
Luděk Cienciala has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Lucie Ciencialová
Silesian University in Opava
11 shared publications - Erzsébet Csuhaj-Varjú
Department of Algorithms and Their Applications, Faculty of Informatics, ELTE Eötvös Loránd University, Budapest, Hungary
7 shared publications Lucie Ciencialová
Silesian University in Opava
2 shared publications- Petr Sosík
Silesian University in Opava
2 shared publications - Michael J. Dinneen
School of Computer Science, The University of Auckland,Auckland,New Zealand
1 shared publication - Miroslav Langer
Department of Applied Informatics, Faculty of Economics, VSB-Technical University of Ostrava, Ostrava, Czech Republic
1 shared publication
Latest Publications
- Open Access
- 17 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 202-210
Solving QUBO problems with cP systems
P systems with compound terms (cP systems) have been proposed by Radu Nicolescu in 2018. These expressive cP systems have been used to solve well-known NP-complete problems efficiently, such as the Hamiltonian path, traveling salesman, 3-coloring, and software verification problems. In this paper, we use cP systems to provide an efficient parallel solution to the integer-valued quadratic unconstrained Boolean optimization (QUBO) problem.
- 17 May 2024
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 6 (3) , 202-210
Open AccessSolving QUBO problems with cP systems
P systems with compound terms (cP systems) have been proposed by Radu Nicolescu in 2018. These expressive cP systems have been used to solve well-known NP-complete problems efficiently, such as the Hamiltonian path, traveling salesman, 3-coloring, and software verification problems. In this paper, we use cP systems to provide an efficient parallel solution to the integer-valued quadratic unconstrained Boolean optimization (QUBO) problem.
- Open Access
- 18 October 2022
- Published by Springer Nature in Natural Computing
- Vol. 22 (1) , 27-39
About reversibility in sP colonies and reaction systems
In this paper, we study reversibility in sP colonies and in reaction systems. sP colony is a bio-inspired computational model formed from an environment and a finite set of agents. The current state of the environment is represented by a finite set of objects and the current state of the agent is given by a finite multiset of objects. By execution of a program from a set of programs associated with the agent, the agent can change the objects in its own state and possibly in the environment, too. Reaction systems are a bio-inspired computational model where reactants are transformed into products only if some inhibitors are not present. We define sP colonies without input influence and prove that to any reversible sP colony of such type an inverse sP colony can be constructed that performs inverse computation. In the second part of the paper, we show that the concept of a reversible reaction system and the notion of an inverse reaction system can be defined in a similar way, and partially reversible reaction systems can simulate reversible logic gates and reversible Turing machines.
- 18 October 2022
- Published by Springer Nature in Natural Computing
- Vol. 22 (1) , 27-39
Open AccessAbout reversibility in sP colonies and reaction systems
In this paper, we study reversibility in sP colonies and in reaction systems. sP colony is a bio-inspired computational model formed from an environment and a finite set of agents. The current state of the environment is represented by a finite set of objects and the current state of the agent is given by a finite multiset of objects. By execution of a program from a set of programs associated with the agent, the agent can change the objects in its own state and possibly in the environment, too. Reaction systems are a bio-inspired computational model where reactants are transformed into products only if some inhibitors are not present. We define sP colonies without input influence and prove that to any reversible sP colony of such type an inverse sP colony can be constructed that performs inverse computation. In the second part of the paper, we show that the concept of a reversible reaction system and the notion of an inverse reaction system can be defined in a similar way, and partially reversible reaction systems can simulate reversible logic gates and reversible Turing machines.
- Open Access
- 5 November 2020
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 2 (4) , 269-280
P colonies and reaction systems
- 5 November 2020
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 2 (4) , 269-280
Open AccessP colonies and reaction systems
- 6 August 2019
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 1 (3) , 178-197
P colonies
- 6 August 2019
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 1 (3) , 178-197
P colonies
- 15 September 2018
- Published by Springer Nature
- p. 66-76
A Logical Representation of P Colonies: An Introduction
- 15 September 2018
- Published by Springer Nature
- p. 66-76
A Logical Representation of P Colonies: An Introduction
- 1 May 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 724, 61-68
Generalized P colonies with passive environment
- 1 May 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 724, 61-68
Generalized P colonies with passive environment
- 20 July 2016
- Published by Springer Nature in Natural Computing
- Vol. 15 (4) , 541-549
A class of restricted P colonies with string environment
- 20 July 2016
- Published by Springer Nature in Natural Computing
- Vol. 15 (4) , 541-549
A class of restricted P colonies with string environment
- 30 December 2015
- Published by Springer Nature
- p. 369-386
About Models Derived from Colonies
- 17 December 2014
- Published by Springer Nature
- p. 3-19
From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
- 17 December 2014
- Published by Springer Nature
- p. 3-19
From P Colonies to 2D P Colonies and Simulations of Multiagent Systems