10907 search results - page 388 / 2182 » Constraint Based Strategies |
224
click to vote
TEC
2002
15 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
173
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
257
click to vote
PROCEDIA
2011
14 years 9 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
284
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
179
click to vote
ICPR
2000
IEEE
16 years 8 months ago
2000
IEEE
Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo...