You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 13, Issue 12

December 2020 - 39 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Cover Story: We connected two prominent fields of formal methods, the SAT problem and the directed graphs, to introduce the BaW property. Strongly connected directed graphs are represented by black and white SAT problems. Such a SAT problem has exactly two solutions: where each variable is true, and where each variable is false. We defined 3 models: the strong (SM), weak (WM), and Balatonboglár model (BM). Our main results are: (1) SM and WM have the BaW property; (2) every model has the BaW property if it is not weaker than WM, and not stronger than SM; (3) BM has the BaW property, because it fulfills the precondition of (2). These results give us a better understanding of how to represent a SAT problem as a directed graph, although this problem has not been solved yet. View this paper

Articles (39)

  • Article
  • Open Access
3 Citations
2,794 Views
16 Pages

20 December 2020

This work uses the sliding mode control method to conduct the finite-time synchronization of chaotic systems. The utilized parameter selection principle differs from conventional methods. The designed controller selects the unknown parameters indepen...

  • Article
  • Open Access
80 Citations
7,989 Views
32 Pages

Nature-Inspired Optimization Algorithms for Text Document Clustering—A Comprehensive Analysis

  • Laith Abualigah,
  • Amir H. Gandomi,
  • Mohamed Abd Elaziz,
  • Abdelazim G. Hussien,
  • Ahmad M. Khasawneh,
  • Mohammad Alshinwan and
  • Essam H. Houssein

18 December 2020

Text clustering is one of the efficient unsupervised learning techniques used to partition a huge number of text documents into a subset of clusters. In which, each cluster contains similar documents and the clusters contain dissimilar text documents...

  • Article
  • Open Access
2 Citations
4,497 Views
19 Pages

16 December 2020

Langton’s ant is a deterministic cellular automaton studied in many fields, artificial life, computational complexity, cryptography, emergent dynamics, Lorents lattice gas, and so forth, motivated by the hardness of predicting the ant’s m...

  • Article
  • Open Access
8 Citations
2,964 Views
26 Pages

Person Re-Identification across Data Distributions Based on General Purpose DNN Object Detector

  • Roxana-Elena Mihaescu,
  • Mihai Chindea,
  • Constantin Paleologu,
  • Serban Carata and
  • Marian Ghenescu

15 December 2020

Solving the person re-identification problem involves making associations between the same person’s appearances across disjoint camera views. Further, those associations have to be made on multiple surveillance cameras in order to obtain a more...

  • Article
  • Open Access
1 Citations
4,498 Views
16 Pages

14 December 2020

To manage multidimensional point data more efficiently, this paper presents an improvement, called HD-tree, of a previous indexing method, called D-tree. Both structures combine quadtree-like partitioning (using integer shift operations without stori...

  • Article
  • Open Access
7 Citations
3,867 Views
12 Pages

14 December 2020

We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid al...

  • Article
  • Open Access
5 Citations
3,440 Views
12 Pages

14 December 2020

In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised tec...

  • Article
  • Open Access
2 Citations
3,958 Views
18 Pages

Design Limitations, Errors and Hazards in Creating Decision Support Platforms with Large- and Very Large-Scale Data and Program Cores

  • Elias Koukoutsis,
  • Constantin Papaodysseus,
  • George Tsavdaridis,
  • Nikolaos V. Karadimas,
  • Athanasios Ballis,
  • Eirini Mamatsi and
  • Athanasios Rafail Mamatsis

14 December 2020

Recently, very large-scale decision support systems (DSSs) have been developed, which tackle very complex problems, associated with very extensive and polymorphic information, which probably is geographically highly dispersed. The management, updatin...

  • Article
  • Open Access
17 Citations
5,077 Views
16 Pages

A New Click-Through Rates Prediction Model Based on Deep&Cross Network

  • Guojing Huang,
  • Qingliang Chen and
  • Congjian Deng

14 December 2020

With the development of E-commerce, online advertising began to thrive and has gradually developed into a new mode of business, of which Click-Through Rates (CTR) prediction is the essential driving technology. Given a user, commodities and scenarios...

  • Article
  • Open Access
1 Citations
2,469 Views
18 Pages

13 December 2020

Evaluation of agricultural investment climate has essential reference value for site selection, operation and risk management of agricultural outward foreign direct investment projects. This study builds a back propagation neural network-based agric...

of 4

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893Creative Common CC BY license