Sciweavers

9719 search results - page 150 / 1944
» Answer Set Optimization
Sort
View
93
Voted
MICAI
2004
Springer
15 years 6 months ago
Graduated Errors in Approximate Queries Using Hierarchies and Ordered Sets
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
Adolfo Guzmán-Arenas, Serguei Levachkine
ICLP
2010
Springer
15 years 4 months ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
187
Voted
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 29 days ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
89
Voted
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 6 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 4 months ago
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered...
James Smaldon, Alex Alves Freitas