Simple Neural−Like P Systems for Maximal Independent Set Selection

Simple Neural−Like P Systems for Maximal Independent Set Selection

Show other versions (2)

Bibliografske podrobnosti
Main Authors:	Xu, L, Jeavons, P
Format:	Journal article
Izdano:	2013

Podobne knjige/članki

Simple neural-like p systems for maximal independent set selection.
od: Xu, L, et al.
Izdano: (2013)

Simple neural−like P systems for maximal independent set selection
od: Xu, L, et al.
Izdano: (2013)

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
od: Jeavons, P, et al.
Izdano: (2016)

Feedback from nature: an optimal distributed algorithm for maximal independent set selection
od: Scott, A, et al.
Izdano: (2013)

A polynomial time solution to constraint satisfaction problems by neural−like P systems
od: Xu, L, et al.
Izdano: (2013)

Disjoint maximal independent sets in graphs and hypergraphs
od: Paul Dorbec, et al.
Izdano: (2024-01-01)

On the number of maximal independent sets in a graph
od: David R. Wood
Izdano: (2011-09-01)

Simple algorithms for distributed leader election in anonymous synchronous rings and complete networks inspired by neural development in fruit flies
od: Xu, L, et al.
Izdano: (2015)

Counting Maximal Distance-Independent Sets in Grid Graphs
od: Euler Reinhardt, et al.
Izdano: (2013-07-01)

Number of maximal 2-component independent sets in forests
od: Shuting Cheng, et al.
Izdano: (2022-05-01)

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer
od: Nagpal, Radhika, et al.
Izdano: (2004)

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
od: Massoud Hadian Dehkordi, et al.
Izdano: (2008-03-01)

Independent component analysis for brain FMRI does indeed select for maximal independence.
od: Vince D Calhoun, et al.
Izdano: (2013-01-01)

The complexity of maximal constraint languages
od: Bulatov, A, et al.
Izdano: (2001)

The complexity of maximal constraint languages
od: Bulatov, A, et al.
Izdano: (2001)

Composable core-sets for determinant maximization: A simple near-optimal algorithm
od: Indyk, Piotr
Izdano: (2021)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
od: Nesrine Abbas, et al.
Izdano: (2005-01-01)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
od: Nesrine Abbas, et al.
Izdano: (2005-12-01)

Correction: Independent Component Analysis for Brain fMRI Does Indeed Select for Maximal Independence
Izdano: (2013-01-01)

Correction: Independent Component Analysis for Brain fMRI Does Indeed Select for Maximal Independence.
od: Vince D. Calhoun, et al.
Izdano: (2013-01-01)

Attribute Selection via Maximizing Independent-and-Effective Classification Information Ratio
od: LIU Ye, DAI Jianhua, CHEN Jiaolong
Izdano: (2022-11-01)

A maximal tractable class of soft constraints
od: Cohen, D, et al.
Izdano: (2004)

A maximal tractable class of soft constraints
od: Cohen, D, et al.
Izdano: (2004)

Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph
od: Yulia Terentyeva
Izdano: (2021-06-01)

TEN SIMPLE MAXIMS FOR THE SYSTEMS ANALYST: BRINGING THE IT COMMUNTY INTO THE CLASSROOM
od: Roy Boggs
Izdano: (2009-01-01)

Maximal set of factors
od: Chris A. Rodger
Izdano: (2004-11-01)

H-hop independently submodular maximization problem with curvature
od: Yang Lv, et al.
Izdano: (2024-09-01)

Independent sets in (P₆, diamond)-free graphs
od: Raffaele Mosca
Izdano: (2009-01-01)

Minimal closed sets and maximal closed sets
od: Fumie Nakaoka, et al.
Izdano: (2006-01-01)

On the Complexity of Target Set Selection in Simple Geometric Networks
od: Michal Dvořák, et al.
Izdano: (2024-08-01)

Sentiment Analysis Of Energy Independence Tweets Using Simple Recurrent Neural Network
od: Kurnia Muludi, et al.
Izdano: (2021-10-01)

Supervised feature selection based on rough set theory and expectation-maximization algorithm
od: Zhang, Dong
Izdano: (2013)

Tinnitus-like "hallucinations" elicited by sensory deprivation in an entropy maximization recurrent neural network.
od: Aviv Dotan, et al.
Izdano: (2021-12-01)

The maximal factorizations of the finite simple groups and their antomorphism ground /
od: Liebeck, M. W. (Martin W.), 1954-, et al.
Izdano: (1990)

GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
od: ANDREA LUCCHINI, et al.
Izdano: (2020-01-01)

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks
od: Jian Zhou, et al.
Izdano: (2017-11-01)

Maximizing sinusoidal channels of HZSM-5 for high shape-selectivity to p-xylene
od: Chuanfu Wang, et al.
Izdano: (2019-09-01)

Maximal resolving sets in a graph
od: V. Swaminathan, et al.
Izdano: (2024-12-01)

Asymmetric maximal and minimal open sets
od: Mukharjee Ajoy, et al.
Izdano: (2016-01-01)

Some properties of maximal open sets
od: Fumie Nakaoka, et al.
Izdano: (2003-01-01)