Sciweavers

989 search results - page 97 / 198
» Version spaces and the consistency problem
Sort
View
TALG
2010
158views more  TALG 2010»
15 years 18 days ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
FOIKS
2008
Springer
15 years 7 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter
PATAT
2004
Springer
138views Education» more  PATAT 2004»
15 years 11 months ago
Semantic Components for Timetabling
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
Nele Custers, Patrick De Causmaecker, Peter Demees...
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 6 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
CP
2000
Springer
15 years 10 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa