Results 211 to 220 of about 4,492 (243)
Some of the next articles are maybe not open access.
Science of The Total Environment, 2020
Urbanization processes have accelerated over recent decades, prompting efforts to model land use change (LUC) patterns for decision support and urban planning. Cellular automata (CA) are extensively employed given their simplicity, flexibility, and intuitiveness when simulating dynamic LUC.
Yuehui Qian +4 more
openaire +2 more sources
Urbanization processes have accelerated over recent decades, prompting efforts to model land use change (LUC) patterns for decision support and urban planning. Cellular automata (CA) are extensively employed given their simplicity, flexibility, and intuitiveness when simulating dynamic LUC.
Yuehui Qian +4 more
openaire +2 more sources
Reversible Elementary Triangular Partitioned Cellular Automata
2017A three-neighbor triangular partitioned cellular automaton (TPCA) is a CA such that each cell is triangular-shaped and has three parts. A TPCA is called an elementary TPCA (ETPCA), if it is rotation-symmetric, and each part of a cell has only two states.
openaire +2 more sources
CHARACTERIZING THE ABILITY OF PARALLEL ARRAY GENERATORS ON REVERSIBLE PARTITIONED CELLULAR AUTOMATA
International Journal of Pattern Recognition and Artificial Intelligence, 1999A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e. a set of symbol arrays). A "reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an "inverse" system of the ...
KENICHI MORITA +2 more
openaire +1 more source
Using Cellular Automata with Evolutionary Learned Rules to Solve the Online Partitioning Problem
2005 IEEE Congress on Evolutionary Computation, 2005In recent computer science research highly robust and scalable sets that are composed of autonomous individuals have become more and more important. The online partitioning problem (OPP) deals with the distribution of huge sets of agents onto different targets in consideration of several objectives.
A. Goebels, A. Weimer, S. Priesterjahn
openaire +1 more source
2018
This chapter presents the use of Partitioned Cellular Automata—introduced by Morita and colleagues— as the tool to tackle simulation and intrinsic universality in the context of Reversible Cellular Automata. Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one ...
openaire +2 more sources
This chapter presents the use of Partitioned Cellular Automata—introduced by Morita and colleagues— as the tool to tackle simulation and intrinsic universality in the context of Reversible Cellular Automata. Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one ...
openaire +2 more sources
2023
Supplemental Material for Modeling land-use change using partitioned vector cellular automata while considering urban spatial structure by Jing Yang, Xinyu Zhu, Wei Chen, Yizhong Sun and Jie Zhu in Environment and Planning B: Urban Analytics and City ...
Yang, Jing +4 more
openaire +1 more source
Supplemental Material for Modeling land-use change using partitioned vector cellular automata while considering urban spatial structure by Jing Yang, Xinyu Zhu, Wei Chen, Yizhong Sun and Jie Zhu in Environment and Planning B: Urban Analytics and City ...
Yang, Jing +4 more
openaire +1 more source
2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2017
The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute its code only after all the other nodes have executed the previous step.
Giordano A +6 more
openaire +3 more sources
The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute its code only after all the other nodes have executed the previous step.
Giordano A +6 more
openaire +3 more sources
The Journal of Chemical Physics, 2009
In the study of adsorption of simple adsorbates in microporous materials like zeolites, thermodynamic models of small grand-canonical cells with very local interactions [e.g., see K. G. Ayappa, J. Chem. Phys. 111, 4736 (1999)] have been proven to be able to produce thermodynamic properties in very good agreement with the results of experiments and ...
PAZZONA F. G +2 more
openaire +4 more sources
In the study of adsorption of simple adsorbates in microporous materials like zeolites, thermodynamic models of small grand-canonical cells with very local interactions [e.g., see K. G. Ayappa, J. Chem. Phys. 111, 4736 (1999)] have been proven to be able to produce thermodynamic properties in very good agreement with the results of experiments and ...
PAZZONA F. G +2 more
openaire +4 more sources
The Journal of Chemical Physics, 2009
In this second paper we exploit our thermodynamic partitioning cellular automaton (PCA) developed in Paper I [Pazzona et al., J. Chem. Phys. 131, 234703 (2009)] to study interacting molecules adsorbed in microporous materials. We present a mean-field theory of the single cell model at equilibrium followed by a detailed description of the procedure we ...
PAZZONA F. G +2 more
openaire +4 more sources
In this second paper we exploit our thermodynamic partitioning cellular automaton (PCA) developed in Paper I [Pazzona et al., J. Chem. Phys. 131, 234703 (2009)] to study interacting molecules adsorbed in microporous materials. We present a mean-field theory of the single cell model at equilibrium followed by a detailed description of the procedure we ...
PAZZONA F. G +2 more
openaire +4 more sources
2011 11th International Conference on Hybrid Intelligent Systems (HIS), 2011
Graph partitioning is a NP-hard problem with multiple conflicting objectives. The graph partitioning should minimize the inter-partition relationship while maximizing the intra-partition relationship. Furthermore, the partition load should be evenly distributed over the respective partitions.
Mehdi Farshbaf +2 more
openaire +1 more source
Graph partitioning is a NP-hard problem with multiple conflicting objectives. The graph partitioning should minimize the inter-partition relationship while maximizing the intra-partition relationship. Furthermore, the partition load should be evenly distributed over the respective partitions.
Mehdi Farshbaf +2 more
openaire +1 more source