Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,651,636 papers from all fields of science
Search
Sign In
Create Free Account
Majority problem (cellular automaton)
Known as:
Density classification task
, GKL Majority
The majority problem, or density classification task is the problem of finding one-dimensional cellular automaton rules that accurately perform…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Boyer–Moore majority vote algorithm
Cellular automaton
Deterministic algorithm
Genetic algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
WEIGHTED MAJORITY RULE FOR HYBRID CELLULAR AUTOMATA TOPOLOGY AND NEIGHBORHOOD
A. Andreica
,
Camelia Chira
2013
Corpus ID: 16082802
Evolution rules for Cellular Automata (CAs) able to perform computational tasks which require global coordination highlight an…
Expand
2012
2012
Dynamics of Networks Evolved for Cellular Automata Computation
Anca Gog
,
Camelia Chira
Hybrid Artificial Intelligence Systems
2012
Corpus ID: 32512309
Cellular Automata (CAs) represent useful and important tools in the study of complex systems and interactions. The problem of…
Expand
2011
2011
Genetic Algorithm for the solution of majority problem
H. P. M. Melo
2011
Corpus ID: 131449875
Many natural and social systems exhibit globally organized behavior without the aid of a centralized control. Examples of such…
Expand
2009
2009
Solutions on 1-D and 2-D Density Classification Problem Using Programmable Cellular Automata
Sudhakar Sahoo
,
P. Choudhury
,
A. Pal
,
B. K. Nayak
Journal of Cellular Automata
2009
Corpus ID: 377811
This paper presents solutions to Density Classification Task (DCT) using a variant of Cellular Automata (CA) called Programmable…
Expand
Review
2009
Review
2009
El Dilema de Condorcet - el Problema de la Votación por Mayoría Simple de Duncan Black - la Paradoja De Kenneth Arrow - y el Manejo de Agenda
H. Piffano
2009
Corpus ID: 152684001
This paper reviews the familiar “dilemma of Condorcet”, dealing with the voting by simple majority problem, studied by Duncan…
Expand
2005
2005
Using Dynamic Behavior Prediction to Guide an Evolutionary Search for Designing Two-Dimensional Cellular Automata
G. Oliveira
,
Sandra Regina Cardoso Siqueira
European Conference on Artificial Life
2005
Corpus ID: 45606303
The investigations carried out about the relationships between the generic dynamic behavior of cellular automata (CA) and their…
Expand
2004
2004
Variants of the majority problem
M. Aigner
Discrete Applied Mathematics
2004
Corpus ID: 2377731
2003
2003
Two-dimensional cellular automata of radius one for density classification task p=1/2
Rene Reynaga
,
E. Amthauer
Pattern Recognition Letters
2003
Corpus ID: 206037095
2002
2002
Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming
Cândida Ferreira
European Conference on Genetic Programming
2002
Corpus ID: 15825874
Cellular automata are idealized versions of massively parallel, decentralized computing systems capable of emergent behaviors…
Expand
1995
1995
Hierarchical mixture of experts and Max-Min propagation neural networks
P. Estévez
,
R. Nakano
International Conference on Neural Networks
1995
Corpus ID: 122663580
The max-min propagation neural network model is considered as a hierarchical mixture of experts by replacing the max (min) units…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE