|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
M. S. Tarkov, “Associative memory based on cellular neural networks with bipolar stepwise activation function”, Prikl. Diskr. Mat., 2020, no. 48, 100–108  |
|
2019 |
| 2. |
M. S. Tarkov, “Informational capacity of the Hopfield network with quantized weights”, Prikl. Diskr. Mat., 2019, no. 45, 97–103 |
|
2018 |
| 3. |
M. S. Tarkov, “Construction of a Hamming network based on a crossbar with binary memristors”, Prikl. Diskr. Mat., 2018, no. 40, 105–113  |
1
|
|
2017 |
| 4. |
M. S. Tarkov, “Reduction of synapses in the Hopfield autoassociative memory”, Prikl. Diskr. Mat., 2017, no. 37, 107–113 |
1
|
|
2015 |
| 5. |
M. S. Tarkov, “Implementation of a neural WTA-network on the memristor crossbar”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 151–154 |
6
|
| 6. |
M. S. Tarkov, “Solving the traveling salesman problem using a recurrent neural network”, Sib. Zh. Vychisl. Mat., 18:3 (2015), 337–347  ; Num. Anal. Appl., 8:3 (2015), 275–283  |
4
|
|
2013 |
| 7. |
M. S. Tarkov, “Mapping parallel programs onto multicore computers by recurrent neural networks”, Prikl. Diskr. Mat., 2013, no. 2(20), 50–58 |
| 8. |
M. S. Tarkov, “On efficient construction of hamiltonian cycles in distributed computer systems by recurrent neural networks”, UBS, 43 (2013), 157–171 |
2
|
|
2010 |
| 9. |
M. S. Tarkov, “On mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks”, Prikl. Diskr. Mat., 2010, no. 4(10), 33–40 |
| 10. |
M. S. Tarkov, “Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems”, Sib. Zh. Vychisl. Mat., 13:4 (2010), 467–475 ; Num. Anal. Appl., 3:4 (2010), 381–388 |
8
|
|
| Organisations |
|
| |
|
|
Contact us: