Simple neural-like p systems for maximal independent set selection.

Simple neural-like p systems for maximal independent set selection.

Показать другие версии (2)

Membrane systems (P systems) are distributed computing models inspired by living cells where a collection of processors jointly achieves a computing task. The problem of maximal independent set (MIS) selection in a graph is to choose a set of nonadjacent nodes to which no further nodes can be added....

Полное описание

Библиографические подробности
Главные авторы:	Xu, L, Jeavons, P
Формат:	Journal article
Язык:	English
Опубликовано:	2013

Схожие документы

Simple Neural−Like P Systems for Maximal Independent Set Selection
по: Xu, L, и др.
Опубликовано: (2013)

Simple neural−like P systems for maximal independent set selection
по: Xu, L, и др.
Опубликовано: (2013)

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
по: Jeavons, P, и др.
Опубликовано: (2016)

Feedback from nature: an optimal distributed algorithm for maximal independent set selection
по: Scott, A, и др.
Опубликовано: (2013)

A polynomial time solution to constraint satisfaction problems by neural−like P systems
по: Xu, L, и др.
Опубликовано: (2013)

Disjoint maximal independent sets in graphs and hypergraphs
по: Paul Dorbec, и др.
Опубликовано: (2024-01-01)

On the number of maximal independent sets in a graph
по: David R. Wood
Опубликовано: (2011-09-01)

Simple algorithms for distributed leader election in anonymous synchronous rings and complete networks inspired by neural development in fruit flies
по: Xu, L, и др.
Опубликовано: (2015)

Counting Maximal Distance-Independent Sets in Grid Graphs
по: Euler Reinhardt, и др.
Опубликовано: (2013-07-01)

Number of maximal 2-component independent sets in forests
по: Shuting Cheng, и др.
Опубликовано: (2022-05-01)

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
по: Massoud Hadian Dehkordi, и др.
Опубликовано: (2008-03-01)

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer
по: Nagpal, Radhika, и др.
Опубликовано: (2004)

Independent component analysis for brain FMRI does indeed select for maximal independence.
по: Vince D Calhoun, и др.
Опубликовано: (2013-01-01)

The complexity of maximal constraint languages
по: Bulatov, A, и др.
Опубликовано: (2001)

The complexity of maximal constraint languages
по: Bulatov, A, и др.
Опубликовано: (2001)

Composable core-sets for determinant maximization: A simple near-optimal algorithm
по: Indyk, Piotr
Опубликовано: (2021)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
по: Nesrine Abbas, и др.
Опубликовано: (2005-01-01)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
по: Nesrine Abbas, и др.
Опубликовано: (2005-12-01)

Correction: Independent Component Analysis for Brain fMRI Does Indeed Select for Maximal Independence
Опубликовано: (2013-01-01)

Attribute Selection via Maximizing Independent-and-Effective Classification Information Ratio
по: LIU Ye, DAI Jianhua, CHEN Jiaolong
Опубликовано: (2022-11-01)

A maximal tractable class of soft constraints
по: Cohen, D, и др.
Опубликовано: (2004)

A maximal tractable class of soft constraints
по: Cohen, D, и др.
Опубликовано: (2004)

Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph
по: Yulia Terentyeva
Опубликовано: (2021-06-01)

TEN SIMPLE MAXIMS FOR THE SYSTEMS ANALYST: BRINGING THE IT COMMUNTY INTO THE CLASSROOM
по: Roy Boggs
Опубликовано: (2009-01-01)

H-hop independently submodular maximization problem with curvature
по: Yang Lv, и др.
Опубликовано: (2024-09-01)

Independent sets in (P₆, diamond)-free graphs
по: Raffaele Mosca
Опубликовано: (2009-01-01)

Minimal closed sets and maximal closed sets
по: Fumie Nakaoka, и др.
Опубликовано: (2006-01-01)

On the Complexity of Target Set Selection in Simple Geometric Networks
по: Michal Dvořák, и др.
Опубликовано: (2024-08-01)

Sentiment Analysis Of Energy Independence Tweets Using Simple Recurrent Neural Network
по: Kurnia Muludi, и др.
Опубликовано: (2021-10-01)

Supervised feature selection based on rough set theory and expectation-maximization algorithm
по: Zhang, Dong
Опубликовано: (2013)

Tinnitus-like "hallucinations" elicited by sensory deprivation in an entropy maximization recurrent neural network.
по: Aviv Dotan, и др.
Опубликовано: (2021-12-01)

GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
по: ANDREA LUCCHINI, и др.
Опубликовано: (2020-01-01)

The maximal factorizations of the finite simple groups and their antomorphism ground /
по: Liebeck, M. W. (Martin W.), 1954-, и др.
Опубликовано: (1990)

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks
по: Jian Zhou, и др.
Опубликовано: (2017-11-01)

Maximizing sinusoidal channels of HZSM-5 for high shape-selectivity to p-xylene
по: Chuanfu Wang, и др.
Опубликовано: (2019-09-01)

Maximal resolving sets in a graph
по: V. Swaminathan, и др.
Опубликовано: (2024-12-01)

Asymmetric maximal and minimal open sets
по: Mukharjee Ajoy, и др.
Опубликовано: (2016-01-01)

Some properties of maximal open sets
по: Fumie Nakaoka, и др.
Опубликовано: (2003-01-01)

Predicting Maximal Gaps in Sets of Primes
по: Alexei Kourbatov, и др.
Опубликовано: (2019-05-01)

Input Feature Selection Method Based on Feature Set Equivalence and Mutual Information Gain Maximization
по: Xinzheng Wang, и др.
Опубликовано: (2019-01-01)