Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
A hybrid method of evolutionary algorithms is introduced in this study. The hybrid method includes two additional operations, acceleration and migrating operations. These two oper...
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
Praveen Koduru, Sanjoy Das, Stephen Welch, Judith ...
In this paper, we consider a hybrid solution to the sensor network position inference problem, which combines a real-time filtering system with information from a more expensive,...
Dimitri Marinakis, David Meger, Ioannis M. Rekleit...