1684 search results - page 21 / 337 » The lexicographic decision function |
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
ISCAS
2002
IEEE
14 years 2 months ago
2002
IEEE
New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular th...
SAS
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
STACS
1998
Springer
14 years 1 months ago
1998
Springer
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
NIPS
2000
13 years 11 months ago
2000
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...