Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
From MaRDI portal
Publication:403007
DOI10.1016/j.tcs.2014.05.004zbMath1360.68467OpenAlexW2092138534MaRDI QIDQ403007
Ali Maroosi, Ravie Chandren Muniyandi
Publication date: 29 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.004
Related Items (5)
Membrane computing to enhance time efficiency of minimum dominating set ⋮ Solving the N-queens problem using dP systems with active membranes ⋮ Composing the queen's exile -- A knighted chain solution to the \(N\)-queens problem ⋮ A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors ⋮ Cell-like P systems with polarizations and minimal rules
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Quorum sensing P systems
- A uniform solution to SAT using membrane creation
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- A quick introduction to membrane computing
- A survey of known results and research areas for \(n\)-queens
- Solving multidimensional 0-1 knapsack problem with time-free tissue P systems
- Membrane computing. An introduction.
- Solving HPP and SAT by P systems with active membranes and separation rules
- 3-Col problem modelling using simple kernel P systems
- A Linear–time Tissue P System Based Solution for the 3–coloring Problem
- Depth-First Search with P Systems
- A Methodology for Comparing the Execution Time of Metaheuristics Running on Different Hardware
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Modeling Ecosystems Using P Systems: The Bearded Vulture, a Case Study
- An Overview of P-Lingua 2.0
- Membrane Computing
This page was built for publication: Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem