1099 search results - page 26 / 220 » On the Complexity of Computing Evolutionary Trees |
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
—As the application and complexity of microelectromechanical (MEMS) devices increases, there is a corresponding need for automated design and optimization tools to augment engine...
TCOM
2010
14 years 8 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
GLOBECOM
2008
IEEE
14 years 10 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
DCC
2006
IEEE
15 years 3 months ago
2006
IEEE
A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...