Buscar
Mostrando ítems 341-350 de 411
Capítulo de Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Solving Knapsack Problems in a Sticker Based Model
(Springer, 2002)
Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
The P versus NP problem: Unconventional insights from Membrane Computing
(IMCS: International Membrane Computing Society, 2013)
: The P ?=NP question is one of the outstanding open problems in theoretical computer science. The relevance of this question is not only the inherent pleasure of solving a mathematical problem, since an answer to it ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Fault Section Estimation of Power Systems with Optimization Spiking Neural P Systems
(Romanian Academy, Section for Information Science and Technology, 2015)
An optimization spiking neural P system (OSNPS) provides a novel way to directly use a P system to solve optimization problems. This paper discusses the practical application of OSNPS for the first time and uses it to ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A bio-inspired computing model as a new tool for modeling ecosystems: The avian scavengers as a case study
(Science Direct, 2011)
The models used for ecosystems modeling are generally based on differential equations. However, in recent yearsnewcomputational models based on biological processes, or bioinspired models, have arisen, among which are P ...
Capítulo de Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Using Automated Reasoning Systems on Molecular Computing
(Springer, 2005)
This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study the correctness of a program) and DNA computing (as practical devices to handle DNA strands to solve ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Simulating FRSN P Systems with Real Numbers in P-Lingua on sequential and CUDA platforms
(Springer, 2015)
Fuzzy Reasoning Spiking Neural P systems (FRSN P systems, for short) is a variant of Spiking Neural P systems incorporating fuzzy logic elements that make it suitable to model fuzzy diagnosis knowledge and reasoning ...
Tesis Doctoral
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Desarrollo y aplicaciones de un entorno de programación para computación celular: P-Lingua
(2010-06-24)
La presente memoria está estructurada en tres partes que constan de un total de siete capítulos cuyos contenidos se describen sucintamente a continuación. Parte I: Preliminares La memoria comienza con un breve recorrido ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Hecatonquiros: Open-source hardware for aerial manipulation applications
(SAGE, 2020)
This article presents Hecatonquiros, a complete open-source ecosystem for low cost and lightweight robotic manip ulators. It has been released to focus on aerial manipulation applications but can be used in any other robotic ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning
(IOS Press, 2020)
In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random ...
Capítulo de Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes
(Springer, 2004)
Up to now, P systems dealing with numerical problems have been rarely considered in the literature. In this paper we present an effective solution to the Knapsack problem using a family of deterministic P systems with ...