- 22 Ocak 2017
- 2.819
- 4.747
- 83
- Konu Sahibi NeuroCathy
- #1
Ya lütfen konunun yerini değiştirmeyin çünkü cidden derdim bu benim
bir makale okumam lazım salı sunumu var ancak ne yaptım ettim makalenin bir yerini anlayamıyorum bilen var mıdır?? Bilgisayar mühendisi arkadaşa sordum 2 tane onlar da okulda gördük dediler ama bir türlü hatırlayamadılar.
Binary Decision Diagram diye geçiyor.Türkçesi sanırım ikili karar diyagramları
şekil de bu : (b) binary tree yazan
açıklaması ingilizce olduğundan bilenleri kopyalayayım dedim
olmadı anlamıyorum birileri çıksın bilen nolır
salı günü anlatmam lazım derste, anlayıp benim bunu
edit: şemanın açıklaması da şu:
"Here, we present a simplified example of our proposed ZDD-based
method (which will be described in Section 4). Figure 1(a) illustrates the
problem. There are two empty cells numbered 0 and 1 and two blocks
labeled A and B. We wish to assign each block to exactly one cell and each
cell to exactly one block. Naively, we could build the binary decision tree
illustrated in Figure 1(b). The label on each node represents the
combination of a cell number and a block label; for example, 0A denotes
that block A is assigned to cell 0. The dotted and solid lines radiating from
the nodes indicate 0-edges and 1-edges, respectively. If and only if the line
from a node is solid (i.e., a 1-edge), the corresponding block is assigned to
the corresponding cell according to the node label. The Boolean value
inside each round-cornered square distinguishes the 1-terminal and 0-
terminal nodes. If an assignment is feasible, the 1-terminal node is
connected from the last node of the path; otherwise, the 0-terminal node is
connected. To represent all assignments, the binary tree requires up to
Σi=0
xy+1 2i nodes, where and denote the numbers of cells and blocks
respectively. Conversely, a ZDD compresses the set of assignments, as
illustrated in Figure 1(c) [2].
A binary tree can be reduced to a ZDD by three operations: pruning,
removing nodes whose -edge is connected to a 0-terminal node, and
sharing equivalent nodes. For enumeration purposes, we construct a ZDD
by an efficient search method called the frontier method, which requires no
explicit construction of the binary tree."
bir makale okumam lazım salı sunumu var ancak ne yaptım ettim makalenin bir yerini anlayamıyorum bilen var mıdır?? Bilgisayar mühendisi arkadaşa sordum 2 tane onlar da okulda gördük dediler ama bir türlü hatırlayamadılar.
Binary Decision Diagram diye geçiyor.Türkçesi sanırım ikili karar diyagramları
şekil de bu : (b) binary tree yazan
açıklaması ingilizce olduğundan bilenleri kopyalayayım dedim
olmadı anlamıyorum birileri çıksın bilen nolır
salı günü anlatmam lazım derste, anlayıp benim bunu edit: şemanın açıklaması da şu:
"Here, we present a simplified example of our proposed ZDD-based
method (which will be described in Section 4). Figure 1(a) illustrates the
problem. There are two empty cells numbered 0 and 1 and two blocks
labeled A and B. We wish to assign each block to exactly one cell and each
cell to exactly one block. Naively, we could build the binary decision tree
illustrated in Figure 1(b). The label on each node represents the
combination of a cell number and a block label; for example, 0A denotes
that block A is assigned to cell 0. The dotted and solid lines radiating from
the nodes indicate 0-edges and 1-edges, respectively. If and only if the line
from a node is solid (i.e., a 1-edge), the corresponding block is assigned to
the corresponding cell according to the node label. The Boolean value
inside each round-cornered square distinguishes the 1-terminal and 0-
terminal nodes. If an assignment is feasible, the 1-terminal node is
connected from the last node of the path; otherwise, the 0-terminal node is
connected. To represent all assignments, the binary tree requires up to
Σi=0
xy+1 2i nodes, where and denote the numbers of cells and blocks
respectively. Conversely, a ZDD compresses the set of assignments, as
illustrated in Figure 1(c) [2].
A binary tree can be reduced to a ZDD by three operations: pruning,
removing nodes whose -edge is connected to a 0-terminal node, and
sharing equivalent nodes. For enumeration purposes, we construct a ZDD
by an efficient search method called the frontier method, which requires no
explicit construction of the binary tree."
sunun surasinda yeniyal yarismalarina ne kaldi en iyi nickte oyunu beklerim
