2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus) 2021
DOI: 10.1109/elconrus51938.2021.9396339
|View full text |Cite
|
Sign up to set email alerts
|

The Review of Cellular Automata Algorithms for Placement and Routing Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Let C be the set of cells in a grid, and the neighborhood function, denoted by n, can be defined as [25,27]…”
Section: The Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Let C be the set of cells in a grid, and the neighborhood function, denoted by n, can be defined as [25,27]…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…is function will return True if the pair of cells that constitute the input in C are neighbors. For example, in a two-dimensional grid, a particular neighborhood function n(x, y) will return True if x and y are neighbors within the neighborhood of c o where the relationship is defined by [24][25][26][27]…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…In this sense, each probabilistic set is generated by randomizing the degree of participation of each element of its definition field separately. For this purpose, a probabilistic space is introduced and a random variable is assigned to each element with values between the space of the measure of similarity of the factors under consideration [ 7 , 22 , 23 ].…”
Section: Scenariosmentioning
confidence: 99%