• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 35 975 публикаций
Сортировка:
по названию
по году
Глава
Evsutin O., Meshcheryakov R., Tolmachev V. et al. In bk.: Distributed Computer and Communication Networks: 22nd International Conference, DCCN 2019. Vol. 1141. Springer, 2019. P. 574-585.
Добавлено: 23 декабря 2019
Глава
Rybakov M., Shkatov D. In bk.: Advances in Modal Logic. Vol. 13. College Publications, 2020. P. 523-539.
Добавлено: 27 августа 2020
Глава
Milovanov A. In bk.: Sailing Routes in the World of Computation. Springer, 2018. P. 287-296.
Добавлено: 4 сентября 2018
Глава
Shen A., Vereshchagin N. In bk.: Computability and Complexity. Berlin: Springer, 2017. P. 669-737.
Добавлено: 26 октября 2018
Глава
Milovanov A. In bk.: Computer Science – Theory and Applications. 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Vol. 9691: Lecture Notes in Computer Science. Switzerland: Springer, 2016. P. 280-293.

In algorithmic statistics quality of a statistical hypothesis (a model) P for a data x is measured by two parameters: Kolmogorov complexity of the hypothesis and the probability P(x). A class of models SijSij that are the best at this point of view, were discovered. However these models are too abstract. To restrict the class of hypotheses for a data, Vereshchaginintroduced a notion of a strong model for it. An object is called normal if it can be explained by using strong models not worse than without this restriction. In this paper we show that there are “many types” of normal strings. Our second result states that there is a normal object x such that all models SijSij are not strong for x. Our last result states that every best fit strong model for a normal object is again a normal object.

Добавлено: 27 июня 2016
Глава
Milovanov A. In bk.: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2016. Ch. 54. P. 1-13.
Добавлено: 27 июня 2016
Глава
Vereshchagin N., Shen A. In bk.: Measures of Complexity. Festschrift for Alexey Chervonenkis.. Springer, 2015. P. 235-252.
Добавлено: 3 марта 2016
Глава
Kofanov Y. N., Rotkevich A., Sotnikova S. Y. In bk.: Proceedings of the 2019 IEEE International Conference "Quality Management, Transport and Information Security, Information Technologies" (IT&QM&IS). IEEE, 2019. P. 268-272.
Добавлено: 9 января 2020
Глава
Bogoviz A. V., Elykomov V. A. In bk.: Ubiquitous Computing and the Internet of Things: Prerequisites for the Development of ICT. Vol. 826: Studies in Computational Intelligence. Springer, 2019. P. 901-907.
Добавлено: 6 июня 2019
Глава
Dubatovka A., Mikhailova E., Zotov M. et al. In bk.: Communications in Computer and Information Science. Vol. 615: Databases and Information Systems - 12th International Baltic Conference. Springer, 2016. P. 113-125.
Добавлено: 13 февраля 2019
Глава
Raznometov D.A., Korsakov I.N. In bk.: Innovative Information Technologies: Materials of the International scientific–practical conference. Part 2. Prt. 2. M.: HSE, 2014. P. 438-442.
Добавлено: 25 июня 2014
Глава
Alexey A. Lifshits, Avdoshin S. M. In bk.: Emerging Trends in Information Systems: Recent Innovations, Result and Experiences. Netherlands: Springer, 2016. Ch. 6. P. 65-77.
Добавлено: 15 марта 2016
Глава
Lazarev A. A., Kvaratskhelia A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2005). Minsk: 2005. P. 32-33.

We consider NP-hard scheduling problem on a single machine minimizing total tardiness on a single machine. We present a number of polynomial and pseudo-polynomial algorithms for special cases of the problem. Based on these algorithms, we give the algorithm that solves Event-Odd Partition problem in pseudo-polynomial time. This algorithm for Partition problem can handle instances with non-integer parameters.

Добавлено: 4 марта 2013
Глава
Anna Presnova, Valery Afanas'ev. In bk.: IFAC-PapersOnLine. Vol. 51. Iss. 32. Editions Elsevier, 2018. Ch. 45. P. 428-433.
Добавлено: 4 ноября 2018
Глава
Antonov M. In bk.: Philisophy of Law International Symposium "Rationality in Law". Buenos Aires: Faculty of Law of Buenos Aires University, 2014. P. 21-34.
Добавлено: 19 мая 2014
Глава
Kofner J. C. In bk.: EAEU from Lisbon to Vladivostok: Transformations and Perspectives. Berlin: OWC Foreign Publishing Hous, 2018. P. 16-19.

В то время как число нетарифных барьеров (НТБ) в мире растет, Евразийский экономический союз старается сократаить НТБ - и занимается приближением своей системы технического регулирования к той, которая у Европейского союза. Однако, непосредственных выгод для европейских компаний пока не предвидятся.

Добавлено: 4 ноября 2018
Глава
Korolev D. In bk.: Information Innovative Technologies: Materials of the International scientific – рractical conference. M.: Association of graduates and employees of AFEA named after prof. Zhukovsky, 2017. P. 36-39.
Добавлено: 13 марта 2018
Глава
Ospovat K. In bk.: Politics and Aesthetics in European Baroque Tragedy. Leiden: Brill, 2016.
Добавлено: 20 июня 2016
Глава
Chepurenko A. In bk.: Economic Styles in the Process of EU Eastern Enlargement. Baden-Baden: Nomos, 2009. P. 249-255.

One of the most popular statements in the systemic transition literature since the second half of the 1990th is that different experiences of the CEE and Baltic states, on the one hand, and the most of the CIS countries, on the other hand, are embedded in different social norms and values, encouraging efforts in the new EU member states and preventing it in some of CIS countries.

Добавлено: 12 марта 2013
Глава
Grishachev S., Datsyshen V. In bk.: A History of Russo-Japanese Relations: Over Two Centuries of Cooperation and Competition. Vol. 66: A History of Russo-Japanese Relations: Over Two Centuries of Cooperation and Competition. Brill, 2019. Ch. 4. P. 137-151.
Добавлено: 6 октября 2020
Глава
Kasatkin A., Presnyakov S., Kravchenko N. et al. In bk.: SYNCHROINFO 2019 Systems of Signal Synchronization, Generating and Processing in Telecommunications, IEEE Conference # 47541. IEEE, 2019. P. 1-5.
Добавлено: 24 октября 2019