We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
Induction of decision rules within the dominance-based rough set approach to the multiple-criteria sorting decision problem is discussed in this paper. We introduce an algorithm ca...
Salvatore Greco, Benedetto Matarazzo, Roman Slowin...
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...