Theoretical and practical complexity estimates for local propagation methods in constraint-based programming applications
The issues of efficiency and robustness of local propagation methods in conformity to constraint-based programming applications are discussed. Comparative analysis of known algorithms is given and new combined method is proposed. The method allows solving of wider classes of constraint problems for...
Main Authors: | V. A. Semenov, O. V. Sidyaka |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1069 |
Similar Items
-
Object-oriented constraint-based programming: a new paradigm using declarative data modeling languages
by: V. A. Semenov, et al.
Published: (2018-10-01) -
A combined method for verification of large-scale data models
by: V. A. Semenov, et al.
Published: (2018-10-01) -
The algorithm on base of Nelder–Mead modified method and genetic algorithm for strip packing problem
by: Sergey A. Martishin,, et al.
Published: (2018-10-01) -
Methodical approach to the objectivity of assessing economic sustainability of universities
by: Y. V. Gusev, et al.
Published: (2017-08-01) -
IVAN IVANOVICH TUMANOV: A FAMOUS SPECIALIST IN THE PHYSIOLOGY OF ABIOTIC PLANT RESISTANCE
by: I. A. Kosareva
Published: (2018-06-01)