Even prior to content, the genre of a web document leads to a first coarse binary classification of the recall space in relevant and non-relevant documents. Thinking of a genre se...
Andrea Stubbe, Christoph Ringlstetter, Randy Goebe...
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
A prerequisite of any successful social robot is the ability to express its internal state and intention to humans in a natural way. Many researchers studied verbal and nonverbal f...
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...