Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
Action potentials evoke calcium transients in dendrites of neocortical pyramidal neurons with time constants of <100 ms at physiological temperature. This time period may not be...
In this paper, we advocate the use of reactive robots in industrial process control and production management. It is explained why reactive robots are well-suited to modern industr...