In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
In this paper, we propose a new algorithm for BrainComputer Interface (BCI): the Spatially Regularized Common Spatial Patterns (SRCSP). SRCSP is an extension of the famous CSP alg...
The best evolutionary approach can be a difficult problem. In this work we have investigated two evolutionary representations to evolve non-photorealistic renderings: a variable-le...
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...