Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" Therefore, there are exactly n edges going out of (and coming into) any vertex. If a hypercube processor can handle only one edge at any time step, this version of the hypercube will be called the sequential model. Handling (or processing) an edge here... "
Interconnection Networks and Mapping and Scheduling Parallel Computations ... - 277. lappuse
laboja - 1995 - 342 lapas
Ierobežota priekšskatīšana - Par šo grāmatu

Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing ...

Ding-Zhu Du, Xiang-Sun Zhang - 1994 - 688 lapas
...exactly one bit position (ie, the hamming distance between x and y is 1.) Therefore, there are exactly £ edges going out of (and coming into) any vertex. If...edges in a unit step is called the parallel model. We assume the sequential model in this paper. ‘This research was supported in part by an NSF Research...
Ierobežota priekšskatīšana - Par šo grāmatu




  1. Mana bibliotēka
  2. Palīdzība
  3. Izvērstā grāmatu meklēšana