-
Fixed points and attractors of additive reaction systems Nat. Comput. (IF 2.1) Pub Date : 2024-03-15 Rocco Ascone, Giulia Bernardini, Luca Manzoni
-
Handling Sudoku puzzles with irregular learning cellular automata Nat. Comput. (IF 2.1) Pub Date : 2024-03-10 Theodoros Panagiotis Chatzinikolaou, Rafailia-Eleni Karamani, Iosif-Angelos Fyrigos, Georgios Ch. Sirakoulis
-
Variants of distributed reaction systems Nat. Comput. (IF 2.1) Pub Date : 2024-02-25 Erzsébet Csuhaj-Varjú, György Vaszil
A distributed reaction system consists of a finite set of reaction systems that either interact with a common environment or interact with each other by communicating products or reactions. A reaction system is a well-known qualitative formal model of interactions between biochemical reactions. A reaction is a triplet of nonempty sets representing chemicals, called the set of reactants, the set of
-
Ranks of functions specified by minimal reaction systems and induced by images of singletons Nat. Comput. (IF 2.1) Pub Date : 2024-02-24
Abstract This paper studies mathematical properties of reaction systems, which is a formal model introduced by Ehrenfeucht and Rozenberg and inspired by biochemical reactions that occur in living cells. Numerous studies have focused on reaction system ranks of functions specified by minimal reaction systems, where the rank refers to the smallest size among the specifying reaction systems. We particularly
-
Evolving ensembles of heuristics for the travelling salesman problem Nat. Comput. (IF 2.1) Pub Date : 2023-10-25 Francisco J. Gil-Gala, Marko Durasević, María R. Sierra, Ramiro Varela
-
Neighbourhood search for energy minimisation in flexible job shops under fuzziness Nat. Comput. (IF 2.1) Pub Date : 2023-10-18 Pablo García Gómez, Camino R. Vela, Inés González-Rodríguez
-
Programmable single-stranded architectures for computing Nat. Comput. (IF 2.1) Pub Date : 2023-09-26 Yu Kihara, Shinnosuke Seki
-
Parallel pairwise operations on data stored in DNA: sorting, XOR, shifting, and searching Nat. Comput. (IF 2.1) Pub Date : 2023-09-21 Arnav Solanki, Tonglin Chen, Marc Riedel
-
Optimal safe driving dynamics for autonomous interacting vehicles Nat. Comput. (IF 2.1) Pub Date : 2023-09-01 Nathan Cohen, Bastien Chopard, Pierre Leone
-
Distance-based affective states in cellular automata pedestrian simulation Nat. Comput. (IF 2.1) Pub Date : 2023-08-31 Stefania Bandini, Daniela Briola, Alberto Dennunzio, Francesca Gasparini, Marta Giltri, Giuseppe Vizzari
-
Cellular automata simulations of the sintering behavior of ceramics driven by surface energy reduction Nat. Comput. (IF 2.1) Pub Date : 2023-08-30 Garrido-Regife Laura, Jiménez-Morales Francisco, González-Sánchez Manuela, Rivero-Antúnez Pedro, Morales-Flórez Víctor
-
System reduction: an approach based on probabilistic cellular automata Nat. Comput. (IF 2.1) Pub Date : 2023-08-25 Pierre-Alain Toupance, Bastien Chopard, Laurent Lefèvre
-
Synchronization of elementary cellular automata Nat. Comput. (IF 2.1) Pub Date : 2023-08-25 Théo Plénet, Franco Bagnoli, Samira El Yacoubi, Clément Raïevsky, Laurent Lefèvre
-
A classification of S-boxes generated by orthogonal cellular automata Nat. Comput. (IF 2.1) Pub Date : 2023-08-24 Luca Mariot, Luca Manzoni
Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot application of the global rule. The main characteristic that brings together these works is that they employ a single CA rule to define the vectorial Boolean function of the S-box. In this work, we explore a different direction
-
Cellular automata and substitutions in topological spaces defined via edit distances Nat. Comput. (IF 2.1) Pub Date : 2023-08-18 Firas Ben Ramdhane, Pierre Guillon
-
Solving quantum circuit compilation problem variants through genetic algorithms Nat. Comput. (IF 2.1) Pub Date : 2023-08-17 Lis Arufe, Riccardo Rasconi, Angelo Oddi, Ramiro Varela, Miguel Ángel González
-
Fast elitist ABC for makespan optimisation in interval JSP Nat. Comput. (IF 2.1) Pub Date : 2023-08-05 Hernán Díaz, Juan José Palacios, Inés González-Rodríguez, Camino R. Vela
-
Evolutionary feature selection approaches for insolvency business prediction with genetic programming Nat. Comput. (IF 2.1) Pub Date : 2023-07-09 Ángel Beade, Manuel Rodríguez, José Santos
-
Precise makespan optimization via hybrid genetic algorithm for scientific workflow scheduling problem Nat. Comput. (IF 2.1) Pub Date : 2023-07-08 Pablo Barredo, Jorge Puente
-
Linear cuts in Boolean networks Nat. Comput. (IF 2.1) Pub Date : 2023-07-04 Aurélien Naldi, Adrien Richard, Elisa Tonello
-
Complexity of limit cycles with block-sequential update schedules in conjunctive networks Nat. Comput. (IF 2.1) Pub Date : 2023-06-29 Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas
-
An exploration of reversible septenary number-conserving cellular automata: a survey of known methods Nat. Comput. (IF 2.1) Pub Date : 2023-06-20 Barbara Wolnik, Adam Dzedzej, Maciej Dziemiańczuk, Aleksander Wardyn, Bernard De Baets
-
Associating parallel automata network dynamics and strictly one-way cellular automata Nat. Comput. (IF 2.1) Pub Date : 2023-06-09 Pacôme Perrotin
-
Asynchronous, finite dynamical systems Nat. Comput. (IF 2.1) Pub Date : 2023-05-25 Henning S. Mortveit
-
Protein structure prediction with energy minimization and deep learning approaches Nat. Comput. (IF 2.1) Pub Date : 2023-05-08 Juan Luis Filgueiras, Daniel Varela, José Santos
-
Fractal dimension of assemblies in the abstract tile assembly model Nat. Comput. (IF 2.1) Pub Date : 2023-04-26 Daniel Hader, Matthew J. Patitz, Scott M. Summers
-
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher Nat. Comput. (IF 2.1) Pub Date : 2023-03-25 Everton R. Lira, Heverton B. de Macêdo, Danielli A. Lima, Leonardo Alt, Gina M. B. Oliveira
-
Cellular automata and Kan extensions Nat. Comput. (IF 2.1) Pub Date : 2023-01-27 Alexandre Fernandez, Luidnel Maignan, Antoine Spicher
In this paper, we formalize precisely the sense in which the application of a cellular automaton to partial configurations is a natural extension of its local transition function through the categorical notion of Kan extension. In fact, the two possible ways to do such an extension and the ingredients involved in their definition are related through Kan extensions in many ways. These relations provide
-
Population diversity and inheritance in genetic programming for symbolic regression Nat. Comput. (IF 2.1) Pub Date : 2023-01-17 Bogdan Burlacu, Kaifeng Yang, Michael Affenzeller
-
Models to classify the difficulty of genetic algorithms to solve continuous optimization problems Nat. Comput. (IF 2.1) Pub Date : 2023-01-12 Noel E. Rodríguez-Maya, Juan J. Flores, Sébastien Verel, Mario Graff
-
On von Neumann regularity of cellular automata Nat. Comput. (IF 2.1) Pub Date : 2023-01-10 Ville Salo
-
Gravitationally invariant subspaces in quantum computing Nat. Comput. (IF 2.1) Pub Date : 2023-01-10 Tanner Crowder, Marco Lanzagorta
Quantum information systems are fragile and highly susceptible to the deleterious effects of environmental noise. One noise source is due to the direct coupling of a massive spin-based quantum system and classical gravitational fields, which will rotate the spin of a system. Accounting for this rotation, called the Wigner rotation, is extremely difficult, and its effect is cumulative for even the most
-
Information theoretical properties of a spiking neuron trained with Hebbian and STDP learning rules Nat. Comput. (IF 2.1) Pub Date : 2023-01-06 Dominique Chu
-
A frequency-based parent selection for reducing the effect of evaluation time bias in asynchronous parallel multi-objective evolutionary algorithms Nat. Comput. (IF 2.1) Pub Date : 2022-12-29 Tomohiro Harada
-
On the power of membrane dissolution in polarizationless P systems with active membranes Nat. Comput. (IF 2.1) Pub Date : 2022-12-16 Zsolt Gazdag, Károly Hajagos
-
CA-NN: a cellular automata neural network for handwritten pattern recognition Nat. Comput. (IF 2.1) Pub Date : 2022-12-15 Aamir Wali
-
Planar Rosa: a family of quasiperiodic substitution discrete plane tilings with 2n-fold rotational symmetry Nat. Comput. (IF 2.1) Pub Date : 2022-12-07 Jarkko Kari, Victor H. Lutfalla
-
Enumeration of maximal cycles generated by orthogonal cellular automata Nat. Comput. (IF 2.1) Pub Date : 2022-11-26 Luca Mariot
-
On the power of boundary rule application in membrane computing Nat. Comput. (IF 2.1) Pub Date : 2022-11-09 Péter Battyányi
In this paper, it is investigated how different features of membrane systems can be simulated by the boundary rule application. Firstly, it is discussed how the effect of maximally parallel mode can be obtained by non-cooperative boundary rules applied only in sequential mode, then it is also demonstrated how membrane dissolution, or the application of using promoters and inhibitors can be simulated
-
Tissue P systems with evolutional communication rules with two objects in the left-hand side Nat. Comput. (IF 2.1) Pub Date : 2022-10-19 David Orellana-Martín, Luis Valencia-Cabrera, Bosheng Song, Linqiang Pan, Mario J. Pérez-Jiménez
-
About reversibility in sP colonies and reaction systems Nat. Comput. (IF 2.1) Pub Date : 2022-10-18 Ludek Cienciala, Lucie Ciencialová, Erzsébet Csuhaj-Varjú
-
Self-organizing nest migration dynamics synthesis for ant colony systems Nat. Comput. (IF 2.1) Pub Date : 2022-10-08 Matin Macktoobian
-
Is integration of mechanisms a way to enhance a nature-inspired algorithm? Nat. Comput. (IF 2.1) Pub Date : 2022-09-08 Marios Thymianis, Alexandros Tzanetos
-
Analysis of inter and intra-front operations in multi-modal multi-objective optimization problems Nat. Comput. (IF 2.1) Pub Date : 2022-09-08 Mahrokh Javadi, Sanaz Mostaghim
-
A roadmap for solving optimization problems with estimation of distribution algorithms Nat. Comput. (IF 2.1) Pub Date : 2022-09-06 Josu Ceberio, Alexander Mendiburu, Jose A. Lozano
-
The objective that freed me: a multi-objective local search approach for continuous single-objective optimization Nat. Comput. (IF 2.1) Pub Date : 2022-09-05 Pelin Aspar, Vera Steinhoff, Lennart Schäpermeier, Pascal Kerschke, Heike Trautmann, Christian Grimme
-
Dominance-based variable analysis for large-scale multi-objective problems Nat. Comput. (IF 2.1) Pub Date : 2022-08-25 Dani Irawan, Boris Naujoks, Thomas Bäck, Michael Emmerich
-
What’s in a distance? Exploring the interplay between distance measures and internal cluster validity in multi-objective clustering Nat. Comput. (IF 2.1) Pub Date : 2022-08-22 Adán José-García, Julia Handl
-
A parallel data-structure for modular programming of triangulated computing media. Nat. Comput. (IF 2.1) Pub Date : 2022-08-20 Frédéric Gruau
-
Variants of string assembling systems Nat. Comput. (IF 2.1) Pub Date : 2022-08-20 Martin Kutrib, Matthias Wendlandt
-
A comparison of distance metrics for the multi-objective pathfinding problem Nat. Comput. (IF 2.1) Pub Date : 2022-08-19 Jens Weise, Sanaz Mostaghim
-
Spiking neural P systems: main ideas and results Nat. Comput. (IF 2.1) Pub Date : 2022-08-18 Alberto Leporati, Giancarlo Mauri, Claudio Zandron
-
Pure and mixed lexicographic-paretian many-objective optimization: state of the art Nat. Comput. (IF 2.1) Pub Date : 2022-08-16 Leonardo Lai, Lorenzo Fiaschi, Marco Cococcioni, Kalyanmoy Deb
-
Feature selection algorithm based on P systems Nat. Comput. (IF 2.1) Pub Date : 2022-08-16 Hongping Song, Yourui Huang, Qi Song, Tao Han, Shanyong Xu
-
Deep learning networks with rough-refinement optimization for food quality assessment Nat. Comput. (IF 2.1) Pub Date : 2022-08-16 Jin Zhou, Kang Zhou, Gexiang Zhang, Qiyu Liu, Wangyang Shen, Weiping Jin
-
GPU simulations of spiking neural P systems on modern web browsers Nat. Comput. (IF 2.1) Pub Date : 2022-08-12 Arian Allenson M. Valdez, Filbert Wee, Ayla Nikki Lorreen Odasco, Matthew Lemuel M. Rey, Francis George C. Cabarle
-
MOEA/D with gradient-enhanced kriging for expensive multiobjective optimization Nat. Comput. (IF 2.1) Pub Date : 2022-08-13 Fei Liu, Qingfu Zhang, Zhonghua Han
-
Large population sizes and crossover help in dynamic environments Nat. Comput. (IF 2.1) Pub Date : 2022-08-11 Johannes Lengler, Jonas Meier
-
A self-adaptive evolutionary algorithm using Monte Carlo Fragment insertion and conformation clustering for the protein structure prediction problem Nat. Comput. (IF 2.1) Pub Date : 2022-08-11 Rafael Stubs Parpinelli, Nilcimar Neitzel Will, Renan Samuel da Silva
-
Spiking neural P systems and their semantics in Haskell Nat. Comput. (IF 2.1) Pub Date : 2022-08-10 Gabriel Ciobanu, Eneia Nicolae Todoran
We use the functional programming language Haskell to design semantic interpreters for the spiking neural P systems. Haskell provides an appropriate support for implementing the denotational semantics of a concurrent language inspired by the spiking neural P systems. This language and its semantics describe properly the structure and behaviour of the spiking neural P systems. The semantic interpreters