#### Filter Results:

- Full text PDF available (66)

#### Publication Year

1998

2017

- This year (2)
- Last 5 years (17)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Francisco José Romero-Campero
- Int. J. Comput. Math.
- 2006

- Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez
- Electr. Notes Theor. Comput. Sci.
- 2007

In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time… (More)

- Daniel Díaz-Pernil, Francisco Peña-Cantillana, Miguel A. Gutiérrez-Naranjo
- Neurocomputing
- 2013

Skeletonizing an image is representing a shape with a small amount of information by converting the initial image into a more compact representation and keeping the meaning features. In this paper we use spiking neural P systems to solve this problem. Based on such devices, a parallel software has been implemented on the GPU architecture. Some real-world… (More)

- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Francisco José Romero-Campero
- Workshop on Membrane Computing
- 2005

- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Francisco José Romero-Campero, Álvaro Romero Jiménez
- Formal Models, Languages and Applications
- 2007

The Theory of Computation deals with the mechanical solvability of problems, distinguishing clearly between problems for which there are algorithmic procedures solving them, and those for which there are none. But it is very important to clarify the difference between solvability in theory and solvability in practice; that is, studying procedures which can… (More)

- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Francisco José Romero-Campero
- Workshop on Membrane Computing
- 2005

- Miguel A. Gutiérrez-Naranjo, Miguel A. Mart́ınez-del-Amor, Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez
- 2009

The N-queens puzzle consists on placing N queens on an N × N grid in such way that no two queens are on the same row, column or diagonal line. In this paper we present a family of P systems with active membranes (one P system for each value of N) that provides all the possible solutions to the puzzle.

- Andrés Cordón-Franco, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Fernando Sancho-Caparrini
- Workshop on Membrane Computing
- 2003

- Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez
- Int. Conf. on Membrane Computing
- 2010