Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Motion perception in immersive virtual reality environments significantly differs from the real world. For example, previous work has shown that users tend to underestimate trave...
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...