Free search in multidimensional space M

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the modern world of billions connected things and exponentially growing data, search in multidimensional spaces and optimisation of multidimensional tasks will become a daily need for variety of technologies and scientific fields. Resolving multidimensional tasks with thousands parameters and more require time, energy and other resources and seems to be an embarrassing challenge for modern computational systems in terms of software abilities and hardware capacity. Presented study focuses on evaluation and comparison of thousands dimensional heterogeneous real-value numerical optimisation tests on two enhanced performance computer systems. The aim is to extend the knowledge on multidimensional search and identification of acceptable solutions with non-zero probability on heterogeneous tasks. It aims also to study computational limitations, energy consumptions and time. Use of energy and time are measured and analysed. Experimental results are presented and can be used for further research and evaluation of other methods.

Cite

CITATION STYLE

APA

Penev, K. (2018). Free search in multidimensional space M. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10665 LNCS, pp. 399–407). Springer Verlag. https://doi.org/10.1007/978-3-319-73441-5_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free