| G.2.1 Combinatorics | Article |
MULTICRITERION PROBLEMS ON THE COMBINATORIAL SET OF POLYARRANGEMENTS |
Abstract: The multicriterion problem of discrete optimization on the feasible combinatorial set of
polyarrangements is examined. Structural properties of feasible region and different types of effici |
| G.2.1 Combinatorics | Article |
ON PROBLEM OF ADEQUACY OF MULTISET MATHEMATICAL MODELS |
Abstract: The analysis of adequacy of competitiveness assessments based only on the values of
multiplicity function of multiset is made. Such assessments are not adequate according to
representation |
| G.2.1 Combinatorics | Article |
ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS |
Abstract: Distance geometry consists of finding an embedding of a weighted undirected graph in Rn. Since some
years, we are working on suitable discretizations for this problem. Because of the discre |
| G.2.1 Combinatorics | Article |
ON THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN BIPARTITE GRAPHS |
Abstract: In this paper it is shown that for bipartite graphs the structure of the family of maximum independent
sets can be described constructively, in the following sense. For a bipartite graph th |
| G.2.2 Graph Theory | Article |
ONTOLOGY OF EDUCATIONAL STANDARDS |
Abstract: This article discusses the formation of educational standards. The method of forming the content of the
educational process describes. The method is based on the ontological knowledge repre |
| G.2.1 Combinatorics | Article |
OPTIMIZATION OF ATM TELECOMMUNICATION NETWORKS |
Abstract: ATM network optimization problems defined as combinatorial optimization problems are considered.
Several approximate algorithms for solving such problems are developed. Results of their com |
| G.2.1 Combinatorics | Article |
RANDOMIZED PARALLELIZATION – A NEW METHOD FOR SOLVING ... |
Abstract: A new method for solving some hard combinatorial optimization problems is suggested, admitting a
certain reformulation. Considering such a problem, several different similar problems are pr |
| G.2.1 Combinatorics | Article |
RANDOMIZED SET SYSTEMS CONSTRAINED BY THE DISCRETE TOMOGRAPHY |
Abstract: This article, in general, is devoted to a set of discrete optimization issues derived from the
domain of pattern recognition, machine learning and data mining - specifically. The global obj |
| G.2.1 Combinatorics | Article |
RECURRENT PROCEDURE IN SOLVING THE GROUPING INFORMATION PROBLEM IN APPLIED... |
Abstract: Number of The grouping information problem in its two basic manifestations recovering function,
represented by empirical data (observations) and problem of classification (clusterization) a |
| G.2.1 Combinatorics | Article |
REGULAR INVERSIVE POLYTOPES |
Abstract: Corresponding to each regular asymptotic polytope P in hyperbolic n-space Hn is an isomorphic
figure °P in inversive (n1)-space In−1 having many related metric properties. A |
| G.2.1 Combinatorics | Article |
SOLVING LARGE SYSTEMS OF BOOLEAN EQUATIONS |
Abstract. Systems of many Boolean equations with many variables are regarded, which have a lot of practical applications in logic design and diagnostics, pattern recognition, artificial intelligence, |
| G.2.1 Combinatorics | Article |
SOME PROPERTIES IN MULTIDIMENSIONAL MULTIVALUED DISCRETE TORUS |
Abstract: Current research concerns the following issues: n-dimensional discrete torus generated by cycles of
even length is considered; the concept of standard arrangement in the torus is defined an |
| G.2.1 Combinatorics | Article |
SPREADING THE MOORE - PENROSE PSEUDO INVERSE ON MATRICES EUCLIDEAN SPACES: ... |
Abstract: In the paper the development of operating technique for matrices Euclidean spaces is represented.
Particularly, within such development transfer of linear operators’ technique with preser |
| G.2.1 Combinatorics | Article |
THE BOUNDARY DESCRIPTORS OF THE n-DIMENSIONAL UNIT CUBE SUBSET PARTITIONING1 |
Abstract: The specific class of all monotone Boolean functions with characteristic vectors of partitioning of sets of
all true-vertices to be minimal is investigated. These characteristic vectors cor |
| G.2.2 Graph Theory | Article |
THE IMPROVEMENT OF THE PROCESS OF PROVIDING GOVERMENT SERVICES IN MULTIFUNCTIONA |
Abstract: This paper solves the problem of the efficiency of multifunctional centers providing services
(MFC) in Russia. It is used the method of process modeling and improvement to business-processe |
| G.2.3 Applications | Article |
ULTRAMETRIC FECHNERIAN SCALING OF DISCRETE OBJECT SETS |
Abstract: Universal Fechnerian Scaling (UFS) is a principled approach to computing “subjective” distances among
objects (stimuli) from their pairwise discrimination probabilities. It is based on |
| G.2.1 Combinatorics | Article |
VECTOR COMBINATORIAL PROBLEMS IN A SPACE OF COMBINATIONS ... |
Abstract: The paper considers vector discrete optimization problem with linear fractional functions of criteria on a
feasible set that has combinatorial properties of combinations. Structural propert |
| G.2.1 Combinatorics | Article |
VECTORS AND MATRIXES IN GROUPING INFORMATION PROBLEM |
Abstract: Grouping information problem appears in application in two main forms. These are the problem of
recovering function, represented by its observations and the problem of classification (clust |
| G.2.m Miscellaneous | Article |
ЕВКЛИДОВЫ ПРОСТРАНСТВА ЧИСЛОВЫХ ВЕКТОРОВ И |
Аннотация: Определены и рассмотрены базовые линейные структуры матричных евклидовых пространств, которые е� |
| G.2 DISCRETE MATHEMATICS | Article |
ЗАДАЧА ВЫБОРА ТОПОЛОГИЧЕСКОЙ СТРУКТУРЫ СЕТИ ДОСТУПА |
Аннотация: показаны причины, определяющие сложность и нетривиальность задачи синтеза сетей
доступа и предл |
| G.2.1 Combinatorics | Article |
‘FEATURE VECTORS’ IN GROUPING INFORMATION PROBLEM IN APPLIED MATHEMATICS: .. |
Abstract: The grouping information problem manifests itself in two main forms. Namely these are: recovering function, represented by empirical data (observations) and problem of classification (cluste |
Wiki
