Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Complexity-theoretic aspects of expanding cellular automata: Label: en
Iterative arrays with self-verifying communication cell: Label: en
Iterative arrays with finite inter-cell communication: Label: en
Cellular automata and finite groups: Label: en
Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models: Label: en
A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior: Label: en
Preface: Label: en
Discretization of continuous-time quantum walks via the staggered model with Hamiltonians: Label: en
Simplifying the role of signals in tile self-assembly: Label: en
Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect: Label: en
Preface: Label: en
Optimal staged self-assembly of linear assemblies: Label: en
UCNC 2018 special issue editorial: Label: en
Waiting for the rapture: what can we do with computers to (hopefully) witness the emergence of life?: Label: en
Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem: Label: en
Adaptive multimeme algorithm for flexible job shop scheduling problem: Label: en
Cultural particle swarm optimization algorithms for uncertain multi-objective problems with interval parameters: Label: en
Memetic electromagnetism algorithm for surface reconstruction with rational bivariate Bernstein basis functions: Label: en
Preface: Label: en
Minimal reversible circuit synthesis on a DNA computer: Label: en
Activity in Boolean networks: Label: en
Independent finite automata on Cayley graphs: Label: en
A cellular automaton for blocking queen games: Label: en
Shrinking one-way cellular automata: Label: en
Computing the periods of preimages in surjective cellular automata: Label: en
Preface: Label: en
Morphogenetic computing: computability and complexity results: Label: en
Tissue P systems with evolutional communication rules with two objects in the left-hand side: Label: en
Automatic design of arithmetic operation spiking neural P systems: Label: en
Spiking neural P systems and their semantics in Haskell: Label: en
About reversibility in sP colonies and reaction systems: Label: en
On the power of boundary rule application in membrane computing: Label: en
Solving subset sum by spiking neural P systems with astrocytes producing calcium: Label: en
Preface: Label: en
\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter: Label: en
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax: Label: en
Spiking neural P systems: main ideas and results: Label: en
Preface: Label: en
A memetic algorithm for restoring feasibility in scheduling with limited makespan: Label: en
Protein structure prediction in an atomic model with differential evolution integrated with the crowding niching method: Label: en
Preface: Label: en
Benchmarking the performance of genetic algorithms on constrained dynamic problems: Label: en
On the minimal number of generators of endomorphism monoids of full shifts: Label: en
The role of tessellation intersection in staggered quantum walks: Label: en
A binary monkey search algorithm variation for solving the set covering problem: Label: en
Hierarchies and undecidability results for iterative arrays with sparse communication: Label: en
Universal logic elements constructed on the Turing tumble: Label: en
Glider automorphisms and a finitary Ryan's theorem for transitive subshifts of finite type: Label: en
Sequentializing cellular automata: Label: en
Preface: Label: en