Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...