Ausgabe 1/2016
Special Issue: Unconventional computation and natural computation
Inhalt (15 Artikel)
Halting the hallmarks: a cellular automaton model of early cancer growth inhibition
Jenna Butler, Frances Mackay, Colin Denniston, Mark Daley
Pseudo-inversion: closure properties and decidability
Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
Artiom Alhazov, Rudolf Freund, Vladimir Rogozhin, Yurii Rogozhin
Doubles and negatives are positive (in self-assembly)
Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers
On string languages generated by sequential spiking neural P systems based on the number of spikes
Keqin Jiang, Wenli Chen, Yuzhou Zhang, Linqiang Pan
Fast arithmetic in algorithmic self-assembly
Alexandra Keenan, Robert Schweller, Michael Sherman, Xingsi Zhong
More on quantum, stochastic, and pseudo stochastic languages with few states
Arseny M. Shur, Abuzer Yakaryılmaz
A quantum particle swarm optimization for the 0–1 generalized knapsack sharing problem
Boukthir Haddar, Mahdi Khemakhem, Hamza Rhimi, Habib Chabchoub
A review of message passing algorithms in estimation of distribution algorithms
Roberto Santana, Alexander Mendiburu, Jose A. Lozano
Evolution of new algorithms for the binary knapsack problem
Lucas Parada, Carlos Herrera, Mauricio Sepúlveda, Víctor Parada