Publications
Article · Azerbaijan Journal of Mathematics · January 1, 2025
On the Completeness of Classes of Correcting Functions of Heuristic Algorithms
Anvar Kabulov, Ibrokhimali Normatov, Islambek Saymanov, A. Baizhumanov
Abstract
We study classes of monotone k-valued corrective functions that preserve values when heuristic algorithms make the correct decision, defined on a certain subset of sets of n-dimensional k-valued lattice S n and corrective sets of heuristic algorithms for solving problems from poorly formalized areas.To completely solve the problem of constructing the simplest continuation in classes of corrective functions, theorems on the completeness of classes of monotone k-valued functions and functions preserving sets of S n for k = 3 are proved, and also bases are created in the given classes.
Advanced Algebra and LogicRough Sets and Fuzzy Logicsemigroups and automata theoryheuristic algorithmslattice functionsdecision-making
More by Islambek Saymanov
- Compressed-Domain Temporal Cues and Degradation-Aware Distillation for Lightweight Dynamic Facial Expression Recognition on Edge DevicesTechnologies · 2026
- Action-Unit-Constrained Graph Learning with Counterfactual Recourse for Auditable Facial Expression RecognitionComputers · 2026
- Three-Class Correspondence Reliability for Deformation-Preserving ICP: Controlled Synthetic Evaluation and a Cross-Domain Stress TestJournal of Imaging · 2026
- An EMC-Aware Multi-Objective Framework for Joint Radio-Resource and Transmit-Power Coordination in Ultra-Dense 5G/Beyond-5G NetworksJournal of Sensor and Actuator Networks · 2026
