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...
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...
This article presents a model for designing negotiation agent with two distinguishing features: 1) a marketdriven strategy and 2) a set of relaxed decision rules. Market-driven ag...