Buscar
Mostrando ítems 11-20 de 56
Artículo
Computing Homology Groups in Binary 2D Imagery by Tissue-like P Systems
(Romanian Academy, Section for Information Science and Technology, 2010)
We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. This is a classical problem in Homology Theory which tries to calculate the number of connected ...
Artículo
Foreword. Special Issue: A selection of papers from the 10th Brainstorming Week on Membrane Computing
(Taylor and Francis, 2013)
Artículo
Small universal simple spiking neural P systems with weights
(Springer, 2014)
Spiking neural P systems with weights (WSN P systems, for short) are a new variant of spiking neural P systems, where the rules of a neuron are enabled when the potential of that neuron equals a given value. It is known ...
Artículo
Intelligent Testing of Traffic Light Programs: Validation in Smart Mobility Scenarios
(Hindawi, 2016)
In smart cities, the use of intelligent automatic techniques to find efficient cycle programs of traffic lights is becoming an innovative front for traffic flow management. However, this automatic programming of traffic ...
Artículo
Multi-objective ligand-protein docking with particle swarm optimizers
(Elsevier, 2019)
In the last years, particle swarm optimizers have emerged as prominent search methods to solve the molecular docking problem. A new approach to address this problem consists in a multi-objective formulation, minimizing the ...
Artículo
Swarm intelligence for traffic light scheduling: Application to real urban areas
(Elsevier, 2012)
Congestion, pollution, security, parking, noise, and many other problems derived from vehicular traffic are present every day in most cities around the world. The growing number of traffic lights that control the vehicular ...
Artículo
Hybrid PSO6 for Hard Continuous Optimization
(Springer, 2015)
In our previous works, we empirically showed that a number of 6±2 informants may endow particle swarm optimization (PSO) with an optimized learning procedure in comparison with other combinations of informants. In this ...
Artículo
P automata revisited
(Elsevier, 2012)
We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable ...
Artículo
Formally Verified Tableau-Based Reasoners for a Description Logic
(Springer, 2014)
Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. One of the most basic description logics is ALC , used as a basis from which to obtain others. Description ...
Artículo
On spiking neural P systems
(Springer, 2010)
This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an ...