Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
The shaky ladder hyperplane-defined functions (sl-hdf's) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. We present...
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGHtree), we construct a memory efficient Huffman table on the ba...