Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alexander Boukhanovsky

◀ ▶ joint publications with Iana S. Polonskaia

> Home > Persons > Alexander Boukhanovsky

Publications

2022
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/NikitinVSPRBMKB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/NikitinVSPRBMKB22
Nikolay O. Nikitin, Pavel Vychuzhanin, Mikhail Sarafanov, Iana S. Polonskaia, Ilia Revin, Irina V. Barabanova, Gleb Maximov, Anna V. Kalyuzhnaya, Alexander Boukhanovsky:
Automated evolutionary approach for the design of composite machine learning pipelines. Future Gener. Comput. Syst. 127: 109-125 (2022)
2021
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2106-15397
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2106-15397
Nikolay O. Nikitin, Pavel Vychuzhanin, Mikhail Sarafanov, Iana S. Polonskaia, Ilia Revin, Irina V. Barabanova, Gleb Maximov, Anna V. Kalyuzhnaya, Alexander Boukhanovsky:
Automated Evolutionary Approach for the Design of Composite Machine Learning Pipelines. CoRR abs/2106.15397 (2021)
2020
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-03010
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-03010
Nikolay O. Nikitin, Iana S. Polonskaia, Anna V. Kalyuzhnaya, Alexander V. Boukhanovsky:
The multi-objective optimisation of breakwaters using evolutionary approach. CoRR abs/2004.03010 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.