553 search results - page 35 / 111 » On the Assessment of Generalisation Consistency |
PKDD
1999
Springer
15 years 4 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
CSR
2006
Springer
15 years 3 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
115
click to vote
IJCAI
1997
15 years 1 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
COLOGNETWENTE
2009
15 years 27 days ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
AI
2006
Springer
14 years 12 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...