Ponencia
Dependency Graph Technique Revisited
Autor/es | Valencia Cabrera, Luis
Orellana Martín, David Pérez Hurtado de Mendoza, Ignacio Pérez Jiménez, Mario de Jesús |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2019 |
Fecha de depósito | 2021-11-23 |
Publicado en |
|
Resumen | The dependency graph technique was initially thought as a method to find
short paths in the computation tree of a membrane system using weak metrics. It could be
used to obtain reasonably fast SAT-solvers, capable of ... The dependency graph technique was initially thought as a method to find short paths in the computation tree of a membrane system using weak metrics. It could be used to obtain reasonably fast SAT-solvers, capable of competing with the ones available in the literature. Later on, they were used as a method to demonstrate the non-efficiency of some membrane systems, capturing the dynamics of the systems by a static directed graph structure. Recently, the dependency graphs have also been used to establish negative results in Membrane Computing. Specifically, in this work, demonstrating the inability of a kind of membrane system to solve some decision problems efficiently by means of a single system. |
Agencias financiadoras | Ministerio de Economia, Industria y Competitividad (MINECO). España |
Identificador del proyecto | TIN2017-89842-P |
Cita | Valencia Cabrera, L., Orellana Martín, D., Pérez Hurtado de Mendoza, I. y Pérez Jiménez, M.d.J. (2019). Dependency Graph Technique Revisited. En CMC20: 20th International Conference on Membrane Computing (513-522), Curtea de Arges, Romania: IMCS: International Membrane Computing Society. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
dependency-graph.pdf | 271.0Kb | [PDF] | Ver/ | |