Derivative-free DIRECT-type global optimization algorithms are increasingly favoured for their simplicity and effectiveness in addressing real-world optimization challenges. This review examines their practical applications through a systematic analysis of scientific journals and computational studies. In particular, significant challenges in reproducibility have been identified with practical problems. To address this, we conducted an experimental study using practical problems from reputable CEC libraries, comparing DIRECT-type techniques against their state-of-the-art counterparts. Therefore, this study sheds light on current gaps, opportunities, and future prospects for advanced research in this domain, laying the foundation for replicating and expanding the research findings presented herein.
Pub. online:28 Feb 2023Type:Research ArticleOpen Access
Journal:Informatica
Volume 34, Issue 2 (2023), pp. 415–448
Abstract
Multiple Criteria Decision-Making (MCDM) is one of the most reliable and applicable decision-making tools to address real-life complex and multi-dimensional problems in accordance with the concepts of sustainable development and circular economy. Although there have been several literature reviews on several MCDM methods, there is a research gap in conducting a literature review on the Multi-Attributive Border Approximation area Comparison (MABAC) as a useful technique to deal with intelligent decision-making systems. This study attempts to present a comprehensive literature review of 117 articles on recent developments and applications of MABAC. Future outlook is provided considering challenges and current trends.
Journal:Informatica
Volume 21, Issue 1 (2010), pp. 13–30
Abstract
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences are very abundant in periodic patterns, which play important biological roles. The complexity of genetic sequences can be estimated using the information-theoretic methods. Low complexity regions are of particular interest to genome researchers, because they indicate to sequence repeats and patterns. In this paper, the complexity of genetic sequences is estimated using Shannon entropy, Rényi entropy and relative Kolmogorov complexity. The structural complexity based on periodicities is analyzed using the autocorrelation function and time delayed mutual information. As a case study, we analyze human 22nd chromosome and identify 3 and 49 bp periodicities.
Journal:Informatica
Volume 7, Issue 1 (1996), pp. 15–26
Abstract
In this paper, we propose to present the direct form recursive digital filter as a state space filter. Then, we apply a look-ahead technique and derive a pipelined equation for block output computation. In addition, we study the stability and multiplication complexity of the proposed pipelined-block implementation and compare with complexities of other methods. An algorithm is derived for the iterative computation of pipelined-block matrices.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 301–337
Abstract
Small training sample effects common in statistical classification and artificial neural network classifier design are discussed. A review of known small sample results are presented, and peaking phenomena related to the increase in the number of features and the number of neurons is discussed.