Authors:
Boris Melnikov
1
;
Alexey Radionov
1
and
Viktor Gumayunov
2
Affiliations:
1
Togliatti State Univ., Russian Federation
;
2
Ulyanovsk State Univ., Russian Federation
Keyword(s):
Anytime algorithm, discrete optimization problem, local heuristics, minimization, nondeterministic finite automata, disjunctive normal forms.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence and Decision Support Systems
;
Enterprise Information Systems
;
Strategic Decision Support Systems
Abstract:
In previous paper we considered some heuristic methods of decision-making for various discrete optimization problems; all these heuristics should be considered as the combination of them and form a common multi-heuristic approach to the various problems. And in this paper, we begin to consider local heuristics, which are different for different problems. At first, we consider two problems of minimization: for nondeterministic finite automata and for disjunctive normal forms. Our approach can be considered as an alternative to the methods of linear programming, multi-agent optimization, and neuronets.