874 search results - page 37 / 175 » Computing Weighted Solutions in Answer Set Programming |
ICCV
2005
IEEE
15 years 20 days ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
LPNMR
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
PODS
2003
ACM
14 years 11 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...