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)

Correction: Independent Component Analysis for Brain fMRI Does Indeed Select for Maximal Independence.
द्वारा: Vince D. Calhoun, और अन्य
प्रकाशित: (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)

Maximal set of factors
द्वारा: Chris A. Rodger
प्रकाशित: (2004-11-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)