scroll identifier for mobile
main-content

## Natural Computing OnlineFirst articles

11-07-2019

### A binary monkey search algorithm variation for solving the set covering problem

In complexity theory, there is a widely studied grouping of optimization problems that belongs to the non-deterministic polynomial-time hard set. One of them is the set covering problem, known as one of Karp’s 21 $${\mathscr {NP}}$$ NP -complete …

10-07-2019

### Integrated probability multi-search and solution acceptance rule-based artificial bee colony optimization scheme for web service composition

Web service composition is considered as the hottest and potential research area in the domain of Service Oriented Architecture since the users focus on Quality of Service (QoS) and transaction properties included in the integration of services.

10-07-2019

### Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations

This work is a thoughtful extension of the ideas sketched in Montalva et al. (AUTOMATA 2017 exploratory papers proceedings, 2017), aiming at classifying elementary cellular automata (ECA) according to their maximal one-step sensitivity to changes …

09-07-2019

### Self-assembly of 3-D structures using 2-D folding tiles

Self-assembly is a process which is ubiquitous in natural, especially biological systems. It occurs when groups of relatively simple components spontaneously combine to form more complex structures. While such systems have inspired a large amount …

29-06-2019