This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
— In this paper we propose a new technique allowing to map descriptive data into relative distance space, which is based primarily on senses of the terms stored in our data. We u...
M. Shahriar Hossain, Monika Akbar, Rafal A. Angryk
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...