205 search results - page 26 / 41 » Decision trees do not generalize to new variations |
DAC
2005
ACM
14 years 9 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
HT
2009
ACM
14 years 3 months ago
2009
ACM
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...
EUROPAR
2007
Springer
14 years 2 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
JMLR
2006
13 years 8 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...