default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman V. Belavkin
Person information
- affiliation: Middlesex University London, UK
- affiliation (PhD 2003): University of Nottingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c21]Silviu Tudor Marc
, Roman V. Belavkin, David Windridge, Xiaohong W. Gao:
An Evolutionary Approach to Automated Class-Specific Data Augmentation for Image Classification. DIS 2023: 170-185- 2022
- [c20]Roman V. Belavkin, Panos M. Pardalos, José C. Príncipe:
Value of Information in the Mean-Square Case and Its Application to the Analysis of Financial Time-Series Forecast. LION 2022: 549-563 - 2021
- [c19]Gabriele La Malfa, Emanuele La Malfa, Roman V. Belavkin, Panos M. Pardalos, Giuseppe Nicosia:
Distilling Financial Models by Symbolic Regression. LOD 2021: 502-517
2010 – 2019
- 2019
- [i6]Roman V. Belavkin:
Relation between the Kantorovich-Wasserstein metric and the Kullback-Leibler divergence. CoRR abs/1908.09211 (2019) - 2017
- [c18]Elizabeth Aston, Alastair Channon, Roman V. Belavkin, Danna Gifford, Rok Krasovec, Christopher G. Knight:
Critical mutation rate in a population with horizontal gene transfer. ECAL 2017: 446-453 - 2016
- [c17]Christopher G. Knight, Rok Krasovec, Roman V. Belavkin, Alastair Channon, Elizabeth Aston:
Critical Mutation Rate has an Exponential Dependence on Population Size for Eukaryotic-Length Genomes. ALIFE 2016: 172-179 - 2015
- [c16]Elizabeth Aston, Alastair Channon, Roman V. Belavkin, Rok Krasovec, Christopher G. Knight:
Optimal Mutation Rate Control under Selection in Hamming Spaces. ECAL 2015: 640-647 - [c15]Roman V. Belavkin:
Asymmetric Topologies on Statistical Manifolds. GSI 2015: 203-210 - [i5]Roman V. Belavkin:
Asymmetric Topologies on Statistical Manifolds. CoRR abs/1507.08229 (2015) - 2014
- [j4]Manuraj Singh, Xiaochun Cheng, Roman V. Belavkin:
Local Semantic Indexing for Resource Discovery on Overlay Network Using Mobile Agents. Int. J. Comput. Intell. Syst. 7(3): 432-455 (2014) - [i4]Roman V. Belavkin:
Asymmetry of Risk and Value of Information. CoRR abs/1405.5860 (2014) - 2013
- [j3]Roman V. Belavkin:
Optimal measures and Markov transition kernels. J. Glob. Optim. 55(2): 387-416 (2013) - [c14]Pawel Chwalinski, Roman V. Belavkin, Xiaochun Cheng:
Detection of application layer DDoS attack with clustering and likelihood analysis. GLOBECOM Workshops 2013: 217-222 - [c13]Roman V. Belavkin:
Law of Cosines and Shannon-Pythagorean Theorem for Quantum Information. GSI 2013: 369-376 - [c12]Pawel Chwalinski, Roman V. Belavkin, Xiaochun Cheng:
Detection of Application Layer DDoS Attacks with Clustering and Bayes Factors. SMC 2013: 156-161 - 2012
- [j2]Roman V. Belavkin:
On evolution of an information dynamic system and its generating operator. Optim. Lett. 6(5): 827-840 (2012) - [c11]Pawel Chwalinski, Roman V. Belavkin, Xiaochun Cheng:
Detection of HTTP-GET Attack with Clustering and Information Theoretic Measurements. FPS 2012: 45-61 - [i3]Roman V. Belavkin, Alastair Channon, Elizabeth Aston, John Aston, Rok Krasovec, Christopher G. Knight:
Monotonicity of Fitness Landscapes and Mutation Rate Control. CoRR abs/1209.0514 (2012) - 2011
- [j1]Roman V. Belavkin, Christian R. Huyck:
Conflict resolution and learning probability matching in a neural cell-assembly architecture. Cogn. Syst. Res. 12(2): 93-101 (2011) - [c10]Roman V. Belavkin, Alastair Channon, Elizabeth Aston, John Aston, Christopher G. Knight:
Theory and practice of optimal mutation rate control in hamming spaces of DNA sequences. ECAL 2011: 85-92 - [c9]Alastair Channon, Elizabeth Aston, Charles Day, Roman V. Belavkin, Christopher G. Knight:
Critical mutation rate has an exponential dependence on population size. ECAL 2011: 117-124 - [c8]Roman V. Belavkin:
Mutation and optimal search of sequences in nested Hamming spaces. ITW 2011: 90-94 - [c7]Christian R. Huyck, Roman V. Belavkin, Fawad Jamshed, Kailash Nadh, Peter J. Passmore, Emma Byrne, Dan Diaper:
CABot3: A Simulated Neural Games Agent. NeSy 2011: 8-13 - 2010
- [c6]Manuraj Singh, Xiaochun Cheng, Roman V. Belavkin:
Resource Discovery Using Mobile Agents. FCST 2010: 72-77 - [i2]Roman V. Belavkin:
Conservation Law of Utility and Equilibria in Non-Zero Sum Games. CoRR abs/1010.2439 (2010) - [i1]Roman V. Belavkin:
Optimal measures and transition kernels. CoRR abs/1012.0366 (2010)
2000 – 2009
- 2009
- [c5]Roman V. Belavkin:
Bounds of optimal learning. ADPRL 2009: 199-204 - 2008
- [c4]Roman V. Belavkin, Christian R. Huyck:
Emergence of Rules in Cell Assemblies of fLIF Neurons. ECAI 2008: 815-816 - 2007
- [c3]Roman V. Belavkin:
Do Neural Models Scale up to a Human Brain? IJCNN 2007: 2312-2317 - 2005
- [c2]Roman V. Belavkin:
Acting Irrationally to Improve Performance in Stochastic Worlds. SGAI Conf. 2005: 305-316 - 2004
- [c1]Roman V. Belavkin, Frank E. Ritter:
OPTIMIST: A New Conflict Resolution Algorithm for ACT-R. ICCM 2004: 40-45 - 2003
- [b1]Roman V. Belavkin:
On emotion, learning and uncertainty : a cognitive modelling approach. University of Nottingham, UK, 2003
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
