Simple Neural−Like P Systems for Maximal Independent Set Selection

Simple Neural−Like P Systems for Maximal Independent Set Selection

Εμφάνιση άλλων εκδόσεων (2)

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	Xu, L, Jeavons, P
Μορφή:	Journal article
Έκδοση:	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)

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer
ανά: Nagpal, Radhika, κ.ά.
Έκδοση: (2004)

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
ανά: Massoud Hadian Dehkordi, κ.ά.
Έκδοση: (2008-03-01)

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)

The maximal factorizations of the finite simple groups and their antomorphism ground /
ανά: Liebeck, M. W. (Martin W.), 1954-, κ.ά.
Έκδοση: (1990)

GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
ανά: ANDREA LUCCHINI, κ.ά.
Έκδοση: (2020-01-01)

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)