Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial sol...
illion abstracts. Problem. How to find sentences that talk about protein-protein interactions? Example (Non-Interaction Sentence) All our data are consistent with models in which ...
Filip Ginter, Tapio Pahikkala, Sampo Pyysalo, Jorm...
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to t...