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

Algorithms, Volume 14, Issue 6

June 2021 - 30 articles

Cover Story: An approximate 2-decomposable rigid-backbone sequence energy landscape (top) is superimposed over the true sequence energy landscape (bottom). While the two landscapes share a lot, the GMEC in the top landscape corresponds to a shallow basin in the more complex real energy landscape. By enumerating diverse low-energy solutions in the approximate landscape (blacks dots surrounded by circles denoting distance constraints), a third solution emerges in a shallow basin which almost matches the GMEC of the true landscape. View this paper
  • 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.

Articles (30)

  • Article
  • Open Access
12 Citations
4,901 Views
24 Pages

3 June 2021

This paper presents the parameter optimisation of the flight control system of a singlerotor medium-scale rotorcraft. The six degrees-of-freedom (DOF) nonlinear mathematical model of the rotorcraft is developed. This model is then used to develop pro...

  • Article
  • Open Access
15 Citations
3,576 Views
23 Pages

2 June 2021

Probabilistic solar power forecasting has been critical in Southern Africa because of major shortages of power due to climatic changes and other factors over the past decade. This paper discusses Gaussian process regression (GPR) coupled with core ve...

  • Article
  • Open Access
4 Citations
3,494 Views
18 Pages

Approximation Algorithms for Sorting λ-Permutations by λ-Operations

  • Guilherme Henrique Santos Miranda,
  • Alexsandro Oliveira Alexandrino,
  • Carla Negri Lintzmayer and
  • Zanoni Dias

1 June 2021

Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the...

  • Article
  • Open Access
7 Citations
4,188 Views
17 Pages

1 June 2021

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cac...

  • Article
  • Open Access
9 Citations
4,076 Views
14 Pages

31 May 2021

Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sen...

  • Article
  • Open Access
1 Citations
3,116 Views
23 Pages

Storing Set Families More Compactly with Top ZDDs

  • Kotaro Matsuda,
  • Shuhei Denzumi and
  • Kunihiko Sadakane

31 May 2021

Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however, the size o...

  • Article
  • Open Access
14 Citations
4,236 Views
14 Pages

A PID Parameter Tuning Method Based on the Improved QUATRE Algorithm

  • Zhuo-Qiang Zhao,
  • Shi-Jian Liu and
  • Jeng-Shyang Pan

31 May 2021

The PID (proportional–integral–derivative) controller is the most widely used control method in modern engineering control because it has the characteristics of a simple algorithm structure and easy implementation. The traditional PID controller, in...

  • Article
  • Open Access
3,017 Views
15 Pages

31 May 2021

The stochastic approximation algorithm (SAA), starting from the pioneer work by Robbins and Monro in 1950s, has been successfully applied in systems and control, statistics, machine learning, and so forth. In this paper, we will review the developmen...

  • Article
  • Open Access
4 Citations
3,014 Views
22 Pages

Sorting by Multi-Cut Rearrangements

  • Laurent Bulteau,
  • Guillaume Fertin,
  • Géraldine Jean and
  • Christian Komusiewicz

29 May 2021

A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where X1 and Xk...

of 3

Get Alerted

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

XFacebookLinkedIn
Algorithms - ISSN 1999-4893