The evolution of a reaction system is usually achieved by applying a maximal set of reactions in a deterministic manner. In this paper, we consider reaction systems characterized by nondeterministic behaviour, where the set of applied reactions …

A reaction system consists of a background set of entities and a set of reactions. Reactions are specified by three sets of entities: reactants, inhibitors, and products. A reaction is enabled by a state (a subset of entities), if all its …

The convergence rate of the online quantum state fliter (OQSF) algorithm for quantum state estimation in the presence of Gaussian measurement noise and sparse disturbance is investigated in this paper. For the OQSF algorithm, by defining the …

The accurate deployment of 5 G base stations (BSs) in urban environments is essential for achieving optimal network performance. In these scenarios, the most common positions for installing BSs are rooftops, which, however, given the complex …

A memetic approach to protein structure refinement was defined, combining Differential Evolution and the widely used Rosetta Relax refinement protocol. This refinement process can be considered as an optimization problem to optimize the positions …

Artificial Intelligence (AI) has become increasingly integrated into everyday life, with the general population progressively relying on it for even routine tasks. As AI models grow in complexity, precision, and computational power, their energy …

The Bin Packing Problem (BPP) is a well-known NP-hard problem with numerous real-world applications. This study focuses on minimizing waste and maximum lateness in a one-dimensional version of the BPP, which is particularly relevant in industrial …

In the past, there have been many different string insertion operations—often inspired by biological or physical systems—that have been defined and studied using formal language theory. For each such insertion operation, it is common to state …

We continue the investigation of the computational power of non-cooperative polymorphic P systems with no ingredients (no target indicators or any special features added to the rules) in terms of parallel communicating Lindenmayer systems. We …

The growing energy consumption of cloud infrastructure has attained levels that are no longer viable, necessitating the development of energy-aware scheduling algorithms. This work focuses on optimising the scheduling of scientific workflows …

Maximal existential width and maximal universal width provide methods of quantifying the amount of nondeterminism and parallelism, respectively, present in computations of an alternating finite automaton (AFA). In this paper, we primarily seek to …

Lindenmayer systems (L-systems) are string rewriting systems that can model and be used to create simulations of processes with inherent parallelism and self-similarity. Inference of L-systems involves the automated learning of these …

Structure guides computation in biological and artificial neural networks. However, the nature of the relationship between structure and function, in this context, is unclear. For example, there is still debate on whether constraining a network …

Self-assembly refers to the process by which small, simple components mix and combine to form complex structures using only local interactions. Designed as a hybrid between tile assembly models and cellular automata, the Tile Automata (TA) model …

This article addresses the flexible job shop problem with uncertain processing times modelled by intervals. Due to climate change and the need for energy efficiency, there is an increasing interest in sustainability in addition to traditional …

The growth pattern of an invasive cell-to-cell propagation (called the successive coronas) on the square grid is a tilted square. On the triangular and hexagonal grids, it is an hexagon. It is remarkable that, on the aperiodic structure of Penrose …

We perform intensive simulations of the model known as Generalised Langton’s Ants, discovering rules with a large number of highways. We depict the structure of some of them, formally proving that there is no universal bound on the number of …

The main obstacle in the quest for non-uniform cellular automata that meet the often desired property of number conservation is the vast size of the search space, going far beyond the capabilities of today’s computers. In this paper, we expound …

Generalized Nash Equilibrium is an extended version of the standard Nash Equilibrium with important implications in real-life problems such as economics, wireless communication, the electricity market, or engineering among other areas. In this …

Virus machines are computing devices inspired by the transmission and replication of viruses. This model of computation has been proved to be as powerful as Turing machines, while using very simple semantics: instructions can open channels to let …