1596 search results - page 257 / 320 » Human-Guided Simple Search |
155
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
137
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
126
click to vote
EKAW
2006
Springer
15 years 7 months ago
2006
Springer
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
152
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
135
click to vote
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...