845 search results - page 29 / 169 » Complexity Dimensions and Learnability |
JGAA
2002
13 years 9 months ago
2002
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
IANDC
2006
13 years 9 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
SASO
2010
IEEE
13 years 7 months ago
2010
IEEE
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
EXPERT
2008
13 years 9 months ago
2008
: In this article we analyze the current state of case-based plan adaptation research. We include the traditional distinction between transformational and derivational analogy but ...
STOC
1994
ACM
14 years 1 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...