solving the satisfiability problem is called mechanical theorem proving. One of those mechanical theorem proving methods is the resolution principle which was invented by J.R. Robinson. In this paper, we shall show how an algorithm based upon the resolution principle can be analyzed. Letnandr0denot...
The backtracking algorithm is another systematic technique used to explore the entire search space by trying out different choices at each decision point and backtracking when a constraint is violated or a dead-end is reached. Zhang et al. [74] employ the backtracking algorithm to map the nodes...
Simulated annealingConstrained optimization problemsThe backtracking search optimization algorithm (BSA) is one of the recently proposed evolutionary algorithms (EAs) for solving numerical optimization problems. In this study, a nature-inspired...doi:10.1007/s00521-017-3329-5Hailong Wang...
Algorithm Computing First (A) Simplified algorithm in the absence of ε-production. For all non-terminal A do First(A):={ }; While there are changes to any First(A) do For each production choice A → X 1 X 2 … X n do Add First(X 1 ) to First(A); Notice: the First set ca...
To prevent the ants from getting into a deadlock state, we introduce a backtracking mechanism to enable the ants to explore the solution space better. Finally, to verify the effectiveness of the proposed algorithm, the algorithm is compared with 11 existing methods for solving the robot path ...
The backtracking search optimization algorithm (BSA) is one of the recently proposed evolutionary algorithms (EAs) for solving numerical optimization problems. In this study, a nature-inspired modified BSA (called SSBSA) is proposed and investigated to improve the exploitation and ...
estimate (recruiting a Lempel–Ziv compression algorithm) can be used to accurately predict legal operations on syntactic workspaces, directly in line with formulations of variational free energy minimization. This is used to motivate a general principle of language design that we term Turing–Chomsky ...
Over the last decade, a trend of developing novel adaptive algorithms based on strong foundations of fractional calculus can be seen [9–15]. The idea of incorporating the fractional derivative into the conventional iterative procedure of the least mean square (LMS) algorithm was first introduced ...