• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдены 30 032 публикации
Сортировка:
по названию
по году
Глава
Lanin V., Uzunova E., Yugov A. et al. In bk.: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2013. Kazan: 2013. P. 139-143.

Today many problems that are dedicated to a particular problem domain can be solved using DSL. Thus to use DSL it must be created or it can be selected from existing ones. Creating a completely new DSL in most cases requires high financial and time costs. Selecting an appropriate existing DSL is an intensive task because such actions like walking through every DSL and deciding if current DSL can handle the problem are done manually. This problem appears because there are no DSL repository and no tools for matching suitable DSL with specific task. This paper observes an approach for implementing an automated detection of requirements for DSL (ontology-based structure) and automated DSL matching for specific task.

Добавлено: 21 января 2014
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 23-23.

We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the job jcompletion time. We have suggest an approximation scheme to find approximate optimal value of the objective function.

Добавлено: 4 марта 2013
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 13-13.

In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of jobs) with minimum of estimation of absolute error that$$0\le L_{max}^A(\pi^B)-L_{max}^A(\pi^A)\le \rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B),$$ where $\rho_d(A,B)=\max\limits_{j\in N}\{d_j^A-d_j^B\}-\min\limits_{j\in N}\{d_j^A-d_j^B\},$ $ \rho_r(A,B)=\max\limits_{j\in N}\{r_j^A-r_j^B\}-\min\limits_{j\in N}\{r_j^A-r_j^B\}$ and$\rho_p(A,B)=\sum\limits_{j\in N}|p_j^A-p_j^B|,$ and $\pi^A, \pi^B$ -- optimal schedules for instances $A$ and $B$,respectively. Besides $\rho(A,B)=\rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B)$ satisfies to properties of the metrics in$(3n-2)$-dimensional space $\{(r_j,p_j,d_j)\,|\,j\in N\}$ with fixed in two parameters.

Добавлено: 4 марта 2013
Глава
Korenev P. S., Lazarev A. A. In bk.: 13th International Conference on Project Management and Scheduling (PMS 2012). Leuven, April 1-4, 2012. Leuven: Katholieke Universiteit Leuven, 2012. P. 195-198.

In the paper, we consider the NP-hard total tardiness minimization on a single machine scheduling problem. We propose a metric for that problem and present a new polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance in the metric from an initial instance.

Добавлено: 27 декабря 2012
Глава
Protopopescu T. I. In bk.: Symposium on Logical Foundations of Computer Science (LFCS 2016). Vol. 9537: Logical Foundations of Computer Science. Springer, 2016. P. 317-330.
Добавлено: 25 ноября 2016
Глава
Schang F. In bk.: The square of opposition: a cornerstone of thought. Basel: Birkhäuser, 2016.

An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. To finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.

Добавлено: 14 июня 2016
Глава
Fuad Aleskerov, Sergey Demin. In bk.: Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights. Switzerland: Springer, 2016. P. 1-14.
Добавлено: 19 декабря 2016
Глава
Evguenia Bessonova, Natalia Tourdyeva, Volchkova N. In bk.: The Uppsala Yearbook of Eurasian Studies I. L.: Wildy, Simmonds & Hill Publishing, 2016. Ch. 1. P. 1-19.
Добавлено: 14 марта 2017
Глава
Mirkin B., Chernyak E. L. In bk.: Clusters, orders, trees: methods and applications. In Honor of Boris Mirkin's 70th Birthday. Vol. 92. Berlin: Springer, 2014.

Abstract. A suffix-tree based method for measuring similarity of a key phrase to an unstructured text is proposed. The measure involves less computation and it does not depend on the length of the text or the key phrase. This applies to the following tasks in semantic text analysis:

Finding interrelations between key phrases over a set of texts;

Annotating a research article by topics from a taxonomy of the domain;

Clustering relevant topics and mapping clusters on a domain taxonomy. 

 

Добавлено: 4 ноября 2013
Глава
Shilov V., Silantiev S., Kitov V. A. In bk.: Third International Conference on the History and Philosophy of Computing [HaPoC 2015]. October 8-11, 2015. Pisa, Italy. Preliminary Proceedings. Piza: Pisa University Press, 2015. Ch. 21. P. 53-55.
Добавлено: 15 марта 2016
Глава
Nurullin R. In bk.: Babel und Bibel 7: Annual of Ancient Near Eastern, Old Testament, and Semitic Studies. Winona Lake: Eisenbrauns, 2013. P. 175-229.
Добавлено: 20 октября 2017
Глава
Vasyukov V. L. In bk.: Двенадцатая международная конференция "Современная логика: проблемы теории, истории и применения в науке", 22-24 июня 2016. St. Petersburg: СПбГУ, 2016. P. 204-206.
Добавлено: 23 октября 2016
Глава
Савицкий С. А. In bk.: Tra memoria e utopia: il samizdat come simbolo della cultura europea. Storia, confini, prospettive. Padova: 2012. P. 65-72.

В статье описывается специфика функционирования неофициальных сообществ в Москве и Ленинграде. Московский андеграунд был ближе к актуальному постмодернистскому искусству, в то время как ленинградский контекст сохранял более тесные связи с модернистской традицией.

Добавлено: 29 октября 2017
Глава
Zardini E. In bk.: Quantifiers, Quantifiers, and Quantifiers: Themes in Logic, Metaphysics, and Language. Dordrecht: Springer, 2015. P. 489-526.
Добавлено: 27 октября 2018
Глава
Berry J. W. In bk.: Advances in cognitive science. New Delhi: Sage, 2008. P. 300-311.
Добавлено: 2 июля 2014
Глава
TIWARI A., OJHA S., Pantiukhin D. In bk.: 3rd IEEE International Conference on "Computational Intelligence and Communication Technology", CICT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. P. 1-5.
Добавлено: 31 августа 2018
Глава
Petrosyants K. O., Kharitonov I. A., Kozhukhov M. V. et al. In bk.: 2017 International Workshop on Reliability of Micro- and Nano-Electronic Devices in Harsh Environment” (IWRMN-EDHE 2017). Institute of Microelectronics of Chinese Academy of Sciences, 2017. P. 1-3.
Добавлено: 16 октября 2017
Глава
Vladislav Podymov. In bk.: Concurrency, Specification & Programming. 24th International Workshop, CS&P 2015. Rzeszow, Poland, September 28-30, 2015. Proceedings. Vol. 2. University of Rzeszow, 2015. P. 85-96.
Добавлено: 11 октября 2015
Глава
Ladynin I. A. In bk.: Mobilität in den Kulturen der antiken Mittelmeerwelt: Stuttgarter Kolloquium zur Historischen Geographie des Altertums 11, 2011. Stuttgart: Franz Steiner Verlag, 2014. P. 343-354.

Статья посвящена сведениям автобиографической надписи вельможи Сематауитефнахта на т.н. Неаполитанской стелы конца IV в. до н.э. В ней приведены аргументы против устоявшегося мнения о том, что этот вельможа оказался в 340-330-е гг. до н.э. при дворе Великого царя и, может быть, участвовал в войне против Александра по собственной воле, в силу своей проперсидской позиции

Добавлено: 25 августа 2018
Глава
Ladynin I. A. In bk.: Alexander the Great and the East: History, Art, Tradition. Wiesbaden: Harrassowitz Verlag, 2016. P. 9-18.

Статья посвящена анализу двух египетских источников, возможно, отразивших ситуации контактов знатных египтян с Александром Великим.

Добавлено: 25 августа 2018
Глава
Булычев Д. Ю., Дмитрий Л. In bk.: 4th International Ershov Conference on Perspectives of System Informatics. 2002.
Добавлено: 31 октября 2018