768 search results - page 1 / 154 » Asymptotic Cellular Complexity |
DLT
2009
13 years 2 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
GLOBECOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— For a multiple-input single-output (MISO) downlink channel with ¢ transmit antennas, it has been recently proved that zero-forcing beamforming (ZFBF) to a subset of (a...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
ALGORITHMICA
2010
13 years 4 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...