modifier
发表于 2025-3-25 04:10:56
A Cellular Automaton that Computes Shortest Paths in Grid Grapht state sets. The cells for nodes use a rule to update their states whereas the rest cells including the cells for edges use another rule. That is, two rules are used by the automaton which makes it a non-uniform CA. The worst case time complexity for the scheme is . where . is the total number of nodes in the connected graph.
refine
发表于 2025-3-25 11:00:17
http://reply.papertrans.cn/23/2230/222980/222980_22.png
Nonthreatening
发表于 2025-3-25 12:01:39
http://reply.papertrans.cn/23/2230/222980/222980_23.png
古老
发表于 2025-3-25 19:39:18
Detection of Topology Changes in Dynamical System: An Information Theoretic Approachdelayed mutual-information, the interaction topology of an unknown graph can be reconstructed to some level. We apply this approach on a sliding time window to detect possible changes in the interaction topology over time.
forthy
发表于 2025-3-25 20:41:10
http://reply.papertrans.cn/23/2230/222980/222980_25.png
前面
发表于 2025-3-26 01:31:18
http://reply.papertrans.cn/23/2230/222980/222980_26.png
pellagra
发表于 2025-3-26 04:56:11
Control of 3D Cellular Automata via Actuator and Space Attributes: Application to Fires Forests then given through the attributes and not directly on the state of the system, as was the case in previous works like for the additive (elementary) CA. To illustrate our approach, we consider the fire forest control problem in the 3D cellular automata.
dysphagia
发表于 2025-3-26 09:23:39
0302-9743 nd selected from 40 submissions. They were organized in topical sections named: theory and cryptography, modeling and simulation, and disease spreading dynamics..978-3-030-69479-1978-3-030-69480-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
传染
发表于 2025-3-26 13:36:47
https://doi.org/10.1007/978-3-322-81141-7nown Thue-Morse sequence within real time. Furthermore, we study the real-time generation of unary patterns in depth and obtain a characterization by time-constructible functions and their corresponding unary formal languages.
esculent
发表于 2025-3-26 19:20:25
https://doi.org/10.1007/978-3-322-81160-8r radii in Trivium. Here, we have proposed a 5-neighbourhood CA to be used in Trivium which helps the cipher to attain better cryptographic properties at a faster rate. The diffusion and randomness of the cipher also increases with the use of higher radii, but at the cost of increased computational complexity. The new cipher is named Pentavium.