Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,883,526 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.
2018
2018
New Solutions for the Density Classification Task in One Dimensional Cellular Automata
Zakaria Laboudi
,
S. Chikhi
International Symposium on Modelling and…
2018
Corpus ID: 70180459
The density classification task is one of the most studied benchmark problems to analyze emergent collective computations…
Expand
2013
2013
Using a Hybrid Cellular Automata Topology and Neighborhood in Rule Discovery
A. Andreica
,
Camelia Chira
Hybrid Artificial Intelligence Systems
2013
Corpus ID: 8054391
Cellular Automata are important tools in the study of complex interactions and analysis of emergent behaviour. They have the…
Expand
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
Population structure increases the evolvability of genetic algorithms
Felix J. H. Hol
,
Xin Wang
,
Juan E. Keymer
Complex
2012
Corpus ID: 33013513
Populations are shaped by the spatial structure of their environment: space organizes interactions between individuals locally…
Expand
2011
2011
A Parallel Space Saving Algorithm For Frequent Items and the Riemann – Hurwitz zeta distribution
M. Cafaro
,
P. Tempesta
,
Marco Pulimeno
2011
Corpus ID: 64322878
A parallel version of the Space Saving algorithm to solve the k– majority problem is presented. The algorithm determines in…
Expand
2011
2011
How many dimensions in co-optimization
Wojciech Jaśkowski
,
K. Krawiec
Annual Conference on Genetic and Evolutionary…
2011
Corpus ID: 14726340
Co-optimization test-based problems is a class of tasks approached typically with coevolutionary algorithms. It was recently…
Expand
2011
2011
Enhancing the Computational Mechanics of Cellular Automata
Dávid Iclănzan
,
Anca Gog
,
Camelia Chira
Nature Inspired Cooperative Strategies for…
2011
Corpus ID: 26234461
Cellular Automata are discrete dynamical systems having the ability to generate highly complex behavior starting from a simple…
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
2008
2008
Title: Evolving Cellular Automata with Genetic Algorithms: Analyzing Asynchronous Updates and Small World Topologies
Melanie Mitchell
2008
Corpus ID: 15519344
An abstract of the thesis of Davy Stevenson for the Master of Science in Computer Science presented February 15, 2008. Title…
Expand
1999
1999
Co-evolving demes of non-uniform cellular automata for synchronisation
Vesselin K. Vassilev
,
J. Miller
,
T. Fogarty
Proceedings of the First NASA/DoD Workshop on…
1999
Corpus ID: 1895228
Emergent computation refers to systems in which global information processing appears as a result of the interactions among many…
Expand