Sciweavers

4949 search results - page 37 / 990
» Consistency and Set Intersection
Sort
View
106
Voted
COCOON
2006
Springer
15 years 7 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
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...
136
Voted
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle
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...
142
Voted
JIIS
2006
119views more  JIIS 2006»
15 years 3 months ago
Answering constraint-based mining queries on itemsets using previous materialized results
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...
Roberto Esposito, Rosa Meo, Marco Botta
DAM
2011
14 years 10 months ago
Optimization problems in multiple subtree graphs
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...
Danny Hermelin, Dror Rawitz
108
Voted
AI
2008
Springer
15 years 3 months ago
Properties of tree convex constraints
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 ...
Yuanlin Zhang, Eugene C. Freuder