ALGORITHM FOR COMPETITIVE SELECTION OF CANDIDATES FOR ADMISSION TO THE UNIVERSITY FOR THE SECOND AND SUBSEQUENT YEARS OF STUDY TO THE CONDITION THAT THE SET OF ORDERED PRIORITY AREAS FOR THE PREPARATION OF THE STATEMENT
In this paper the problem is formalized competitive selection and admission to the following courses 2 and the example of the admission campaign in Southwest State University, an algorithm of solving the problem.
Saved in:
| Main Authors: | Oleg V. Ovchinkin, Aleksey I. Pykhtin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Plekhanov Russian University of Economics
2016-05-01
|
| Series: | Открытое образование (Москва) |
| Subjects: | |
| Online Access: | https://openedu.rea.ru/jour/article/view/233 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Generalized H-fold sumset and Subsequence sum
by: Mohan, et al.
Published: (2024-02-01) -
On the cardinality of subsequence sums II
by: Jiang, Xing-Wang, et al.
Published: (2024-11-01) -
Proposed subsequent accounting for goodwill: Comparison of IASB and FASB
by: Yanshan Li, et al.
Published: (2024-10-01) -
An LSH Based Time Subsequence Matching Algorithm
by: Genping Liu, et al.
Published: (2015-08-01) -
Types of subsequences of double sequences and their conver-gence properties
by: Faten Abu Shoga
Published: (2022-10-01)