Theoretical foundations of hardware implementation of multiply neural-like growing networks
The theoretical foundations of the hardware implementation of neural-like growing networks are regarded in the paper. On the base of the given theorems and statements the most crucial relations of the full vectors given union relations of their sub-vectors are determined. As a consequence, the opera...
Збережено в:
| Дата: | 2015 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут проблем математичних машин і систем НАН України
2015
|
| Назва видання: | Математичні машини і системи |
| Теми: | |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/113662 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Theoretical foundations of hardware implementation of multiply neural-like growing networks / V.O. Yashchenko// Математичні машини і системи. — 2015. — № 4. — С. 3-18. — Бібліогр.: 8 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | The theoretical foundations of the hardware implementation of neural-like growing networks are regarded in the paper. On the base of the given theorems and statements the most crucial relations of the full vectors given union relations of their sub-vectors are determined. As a consequence, the operations of construction and functioning of the neural-like network are determined. The increase of the relative speed of the information processing under the increase of its volume is shown. |
|---|