• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 31 100 публикаций
Сортировка:
по названию
по году
Глава
Karpov N., Babkina T. S., Babkin E. In bk.: CEUR Workshop Proceedings. 2nd International Workshop on Ontologies and Information Systems, WOIS 2014; Lund; Sweden; 22 September 2014 through 24 September 2014. Vol. 1230. Lund: CEUR Workshop Proceedings, 2014. P. 43-54.
Добавлено: 20 января 2015
Глава
Aleskerov F. T., Egorova L. G., Gokhberg L. et al. In bk.: Springer Proceedings in Mathematics and Statistics. Volume 104 Models, Algorithms and Technologies for Network Analysis. Cham; Heidelberg; NY; Dordrecht; L.: Springer, 2014. Ch. 1. P. 1-8.
Добавлено: 15 октября 2015
Глава
Katsoulacos Y., Avdasheva S. B., Golovanova S. In bk.: Frédéric Jenny Liber Amicorum: Standing Up for Convergence and Relevance in Antitrust. Vol. 1. Concurrences, 2019. P. 131-150.
Добавлено: 18 января 2019
Глава
Semyon E. Tikhonov, Mitsyuk A. A. In bk.: Analysis of Images, Social Networks and Texts. 8th International Conference AIST 2019. Springer, 2019.
Добавлено: 14 октября 2019
Глава
Ладынин И. А. В кн.: «Хранящий большое время». Сборник научных трудов к 50-летию А.А. Немировского. М.: 2018. С. 11-24.

Во вводной статье к сборнику статей в честь 50-летия А.А. Немировского рассматривается его вклад в науку о древнем Ближнем Востоке на современном этапе.

Добавлено: 24 августа 2018
Глава
Porshnev A., Шашкин П. О. In bk.: Supplementary Proceedings of the 4th International Conference on Analysis of Images, Social Networks and Texts (AIST'2015). Iss. 1452. Aachen: CEUR Workshop Proceedings, 2015. P. 126-136.
Добавлено: 18 февраля 2016
Глава
Sizykh N., Pokusaev P., Sizykh D. In bk.: 2017 Tenth International Conference Management of Large-Scale System Development (MLSD). IEEE, 2017. P. 1-5.
Добавлено: 29 января 2018
Глава
Yu. Grishunina, L. Manita. In bk.: Analytical and computational methods in probability theory and its applications (ACMPT-2017). Proceedings of the International Scientific Conference. M.: RUDN, 2017. P. 80-84.
Добавлено: 20 июня 2018
Глава
Ponomarenko A., Irina Utkina, Mikhail Batsyn. In bk.: Computational Aspects and Applications in Large-Scale Networks. Springer Proceedings in Mathematics & Statistics. Vol. 247. Springer International Publishing AG, 2018. P. 197-203.
Добавлено: 18 октября 2017
Глава
Sandomirskaia M. In bk.: Recent Advances in Game Theory and Applications. Springer, 2016. P. 251-269.

We examine an equilibrium concept for 2-person non-cooperative games with boundedly rational agents which we call Nash-2 equilibrium. It is weaker than Nash equilibrium and equilibrium in secure strategies: a player takes into account not only current strategies but also all profitable next-stage responses of the partners to her deviation from the current profile that reduces her relevant choice set. We provide a condition for Nash-2 existence in finite games and complete characterization of Nash-2 equilibrium in strictly competitive games. Nash-2 equilibria in Hotelling price-setting game are found and interpreted in terms of tacit collusion.

Добавлено: 3 октября 2016
Глава
Panov M., Tatarchuk A., Mottl V. et al. In bk.: Lecture Notes in Computer Science. Vol. 6713: Multiple Classifier Systems: 10th International Workshop, MCS 2011, Naples, Italy, June 15-17, 2011. Proceedings. Springer, 2011. P. 126-136.
Добавлено: 14 марта 2016
Глава
Bolshakova E. I., Sapin A. S. In bk.: Analysis of Images, Social Networks and Texts. 6th International Conference, 2017, Lecture Notes in Computer Science, Revised Selected Papers. Vol. 10716. Cham: Springer, 2018.
Добавлено: 5 сентября 2017
Глава
Seleznev M. In bk.: Babel und Bibel 1 Ancient Near Eastern, Old Testament and Semitic Studies. Winona Lake: Eisenbrauns, 2004. P. 251-258.
Добавлено: 12 августа 2018
Глава
Akopov A. S., Hevencev M.A. In bk.: Proceedings of IEEE International Conference on Systems, Man and Cybernatics, 2013. Manchester: IEEE, 2013. P. 1391-1395.
Добавлено: 30 августа 2013
Глава
Badryzlova Y., Panicheva P. In bk.: Artificial Intelligence and Natural Language, 7th International Conference, AINL 2018, St. Petersburg, Russia, October 17–19, 2018, Proceedings. Iss. 930. Switzerland: Springer, 2018. Ch. 3. P. 23-34.
Добавлено: 30 августа 2018
Глава
Fomichov V. A. In bk.: Pre-Conference Proceedings of the Focus Symposium on Advances in Adaptive Planning Capabilities (August 3, 2010, Focus Symposia Chair: Jens Pohl) in conjunction with InterSymp-2010, 22nd International Conference on Systems Research, Informatics and Cybernetics, August 2 – 6, 2010, Germany). San Luis Obispo: 2010. P. 99-113.

The natural language texts (NL-texts) from the newspapers, e-mail lists, various blogs, etc. are the important sources of information being able to stimulate the elaboration of a new plan of actions. The paper describes a new formal approach to developing multilingual algorithms of semantic-syntactic analysis of NL-texts. It is a part of the theory of K-representations - a new theory of designing semantic-syntactic analyzers of NL-texts with the broad use of formal means for representing input, intermediary, and output data. The current version of the theory is set forth in a monograph published by Springer in 2010. One of the principal constituents of this theory is a complex, strongly structured algorithm SemSynt1 carrying out semantic-syntactic analysis of texts from some practically interesting sublanguages of the English, German, and Russian languages. An important feature of this algorithm is that it doesn’t construct any syntactic representation of the inputted NL-text but directly finds semantic relations between text units. The other distinguished feature is that the algorithm is completely described with the help of formal means, that is why it is problem independent and doesn’t depend on a programming system. The peculiarities and some central procedures of the algorithm SemSynt1 are analyzed.

Добавлено: 29 мая 2013
Глава
Евсютин О. О., Кокурина А. С., Мещеряков Р. В. et al. In bk.: Advances in Intelligent Systems and Computing. Vol. 451: Proceedings of the First International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’16). Springer, 2016.
Добавлено: 8 сентября 2019
Глава
Vladislav Podymov. In bk.: CEUR Workshop Proceedings. Vol. 1492: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming. Rzeszow, Poland, September 28-30, 2015.. CEUR Workshop Proceedings, 2015. P. 85-96.
Добавлено: 10 октября 2016
Глава
Kvaratskhelia A., Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 13-14.

We consider the minimizing total weighted completion time in preemptive equal job length scheduling problem on a single machine with release dates. We propose a polynomial time algorithm that solves the problem. Before this paper, the problem is known to be open.

Добавлено: 4 марта 2013
Глава
Fomichova O. S., Fomichov V. A. In bk.: Personal and Spiritual Development in the World of Cultural Diversity. Iss. 9. Tecumseh: The International Institute for Advanced Studies in Systems Research and Cybernetics, 2012. P. 45-49.

В статье излагается новый подход к рассмотрению импрессионизма в рамках когнитоники. Это новая научная дисциплина, направленная на компенсацию негативных сдвигов в когнитивно-эмоциональном развитии личности и в развитии общества, вызванных стремительным прогрессом информационно-коммуникационных технологий и процессов глобализации. Предложен оригинальный алгоритм преобразования негативных эмоций (вызванных сообщениями, полученными через социальные сети) в позитивные. Этот алгоритм рассматривает возможные реакции человека (в том числе рекомендуемые реакции) на эмоциональные атаки, осуществляемые через социальные сети. В основе этого алгоритма лежит новый взгляд на импрессионизм. Алгоритм является частью оригинального междисциплинарного курса «Основы безопасной жизни в информационном обществе».

Добавлено: 31 января 2013
Глава
Афанасьева С. С., Vostokov S. V., Haustov N. V. et al. In bk.: Vestnik St. Petersburg University: Mathematics. Vol. 50. Iss. 3. Allerton Press Inc., 2017. P. 114-123.

—Ramification in complete discrete valuation fields is studied. For the case of a perfect residue field, there is a well-developed theory of ramification groups. Hyodo introduced the concept of ramification depth associated with the different of an extension and obtained an inequality that combines the concept of ramification depth in a degree p2 cyclotomic extension with the concept of ramification depth in a degree p subextension. The paper gives a detailed consideration of the structure of degree p2 extensions that can be obtained by a composite of two degree p extensions. In this case, it is not required that the residue field be perfect. Using the concepts of wild and ferocious extensions and the defect of the main unit, degree p2 extensions are classified and more accurate estimates for the ramification depth are obtained. In a number of cases, exact formulas for ramification depth are presented.

Добавлено: 4 февраля 2019