The following pages link to Natural Computing (Q243812):
Displaying 50 items.
- Probing robustness of cellular automata through variations of asynchronous updating (Q256417) (← links)
- Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why? (Q256420) (← links)
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Networks of evolutionary processors: computationally complete normal forms (Q256426) (← links)
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers (Q256428) (← links)
- Geometric computations by broadcasting automata (Q256432) (← links)
- New solutions for disjoint paths in P systems (Q256435) (← links)
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes (Q256437) (← links)
- Computing with planar toppling domino arrangements (Q256439) (← links)
- Cellular automata-based systems with fault-tolerance (Q256442) (← links)
- A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids (Q256445) (← links)
- A membrane algorithm with quantum-inspired subalgorithms and its application to image processing (Q256448) (← links)
- Why `GSA: a gravitational search algorithm' is not genuinely based on the law of gravity (Q256452) (← links)
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- One-dimensional staged self-assembly (Q256717) (← links)
- Turing patterns with Turing machines: emergence and low-level structure formation (Q256719) (← links)
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- On the complexity of nonuniform wavelength-based machine (Q256966) (← links)
- Immune clonal coevolutionary algorithm for dynamic multiobjective optimization (Q256969) (← links)
- Identification of components in biochemical pathways: extensive aqpplication to SBML models (Q256973) (← links)
- Deterministic function computation with chemical reaction networks (Q268444) (← links)
- Reachability bounds for chemical reaction networks and strand displacement systems (Q268448) (← links)
- Probabilistic reasoning with a Bayesian DNA device based on strand displacement (Q268450) (← links)
- Entanglement sudden death: a threat to advanced quantum key distribution? (Q268453) (← links)
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457) (← links)
- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) (Q268461) (← links)
- Cryptographic encryption scheme based on metastable excited nuclei (Q268464) (← links)
- Continuous input nonlocal games (Q269046) (← links)
- Implausible consequences of superstrong nonlocality (Q269047) (← links)
- Oblivious transfer and quantum channels as communication resources (Q269051) (← links)
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- Preface: Nature inspired solutions for high performance computing (Q269059) (← links)
- Protein structure prediction using distributed parallel particle swarm optimization (Q269061) (← links)
- Goal distance estimation for automated planning using neural networks and support vector machines (Q269064) (← links)
- A novel text and image encryption method based on chaos theory and DNA computing (Q269066) (← links)
- A preference multi-objective optimization based on adaptive rank clone and differential evolution (Q269071) (← links)
- Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning (Q269771) (← links)
- Exploring programmable self-assembly in non-DNA based molecular computing (Q269774) (← links)
- Foreword: Asynchronous cellular automata and applications (Q269775) (← links)
- Towards intrinsically universal asynchronous CA (Q269777) (← links)
- First steps on asynchronous lattice-gas models with an application to a swarming rule (Q269778) (← links)
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- On computational complexity of graph inference from counting (Q269786) (← links)
- Modeling membrane systems using colored stochastic Petri nets (Q269787) (← links)
- Quadratic interpolation based orthogonal learning particle swarm optimization algorithm (Q269791) (← links)
- Foreword: Cellular automata and applications (Q272764) (← links)
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata (Q272766) (← links)
- Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
