We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
Feature selection is an important preprocessing technique for many pattern recognition problems. When the number of features is very large while the number of samples is relatively...
A 5-year-profiling in production mode at the University of Stuttgart has shown that more than 40% of the execution time of Message Passing Interface (MPI) routines is spent in the...
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
Moustapha Hafez, Matthew D. Lichter, Steven Dubows...