Sciweavers

3775 search results - page 209 / 755
» The Expression Problem Revisited
Sort
View
JAIR
2008
145views more  JAIR 2008»
15 years 4 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
JSAT
2006
108views more  JSAT 2006»
15 years 4 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
JDWM
2007
90views more  JDWM 2007»
15 years 3 months ago
Mining for Mutually Exclusive Items in Transaction Databases
Association rule mining is a popular task that involves the discovery of co-occurences of items in transaction databases. Several extensions of the traditional association rule mi...
George Tzanis, Christos Berberidis
TKDE
2002
133views more  TKDE 2002»
15 years 3 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
KSEM
2010
Springer
15 years 2 months ago
Towards Scalable Instance Retrieval over Ontologies
In this paper, we consider the problem of query answering over large multimedia ontologies. Traditional reasoning systems may have problems to deal with large amounts of expressive...
Alissa Kaplunova, Ralf Möller, Sebastian Wand...