|
|
|
Publications in Math-Net.Ru |
Citations |
|
2017 |
| 1. |
G. S. Veresnikov, O. V. Ogorodnikov, L. A. Pankova, V. A. Pronina, “Solving preliminary design problems under conditions of parametric uncertainty”, Probl. Upr., 2017, no. 4, 65–73  |
1
|
|
2014 |
| 2. |
G. S. Veresnikov, L. A. Pankova, V. A. Pronina, “Uncertain multiobjective programming in the design of aircraft”, Artificial Intelligence and Decision Making, 2014, no. 4, 18–24  |
|
2013 |
| 3. |
L. A. Pankova, V. A. Pronina, “Semantic text retrieval based on fuzzy set theory”, Artificial Intelligence and Decision Making, 2013, no. 3, 19–23 |
| 4. |
L. A. Pankova, V. A. Pronina, “Text retrieval models based on fuzzy set theory”, Probl. Upr., 2013, no. 2, 41–44 |
|
2011 |
| 5. |
L. A. Pankova, V. A. Pronina, K. V. Kryukov, “Ontological models of search for experts in knowledge management systems for scientific organizations”, Probl. Upr., 2011, no. 6, 52–60 |
2
|
|
2010 |
| 6. |
K. V. Kryukov, L. A. Pankova, V. A. Pronina, V. S. Suhoverov, L. B. Shipilina, “Semantic similarity measures in ontology. Review and classification”, Probl. Upr., 2010, no. 5, 2–14 |
8
|
|
2009 |
| 7. |
V. A. Pronina, L. B. Shipilina, “Using relations of attributes for building ontology of subject domain”, Probl. Upr., 2009, no. 1, 27–32 |
4
|
|
2008 |
| 8. |
L. A. Pankova, V. A. Pronina, “Informational and analytical support of housing and communal services management (capital maintenance
planning)”, Probl. Upr., 2008, no. 5, 49–56 |
|
2006 |
| 9. |
L. A. Pankova, V. A. Pronina, “The ways to create a versatile computer modeling toolkit”, Probl. Upr., 2006, no. 6, 2–5 |
|
1975 |
| 10. |
V. A. Pronina, A. A. Chudin, “Syntax-analysis implementation in an associative parallel processor”, Avtomat. i Telemekh., 1975, no. 8, 106–112   ; Autom. Remote Control, 36:8 (1975), 1303–1308 |
| 11. |
V. A. Pronina, “Existence of precedence functions for generative grammars”, Avtomat. i Telemekh., 1975, no. 7, 127–131 ; Autom. Remote Control, 36:7 (1975), 1165–1168 |
|
| Organisations |
|
| |
|
|
Contact us: