Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
— Complex networks have attracted much attention from various fields of sciences and engineering over the last ten years. To reveal the dynamical mechanism of synchronization in...
This paper introduces our recently designed 9/7– 10/8 dual-tree complex filter bank and studies its application in moving object detection and segmentation. The dual-tree compl...
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...