| F.2.m Miscellaneous | Article |
ALGORITHMIC DECIDABILITY OF COMPUTER PROGRAM-FUNCTIONS LANGUAGE PROPERTIES |
Abstract: A mathematical notion of a computer program-function for some programming languages (in particular,
for some versions of Pascal and Turbo/Visual Prolog) is introduced as a restriction of an |
| F.2.1 Numerical Algorithms and Problems | Article |
A COMBINED EXTERIOR PENALTY FUNCTION – CONJUGATE GRADIENT ALGORITHM ... |
Abstract: In this paper, combined exterior penalty function-conjugate gradient algorithm for a constrained optimal
control problem for the coefficients of a quasilinear equation is applied. The const |
| F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY | Article |
A CONCEPT OF A MODEL OF A COMPUTER SYSTEM FOR FORMING COMPLEX UNITERMS |
Abstract: The existing methods of intuitive and mathematical methods of application of algorithms in
system are described. It is shown that in the existing formula editor of algebra of algorithms onl |
| F.2.m Miscellaneous | Article |
A LANGUAGE USING QUANTIFIERS FOR DESCRIPTION OF ASSERTIONS ABOUT ... |
Abstract: Mathematical models of N-finite (N 2) (especially for N= 216 typical for IBM-compatible personal computers) real, integer or Boolean valued computations are proposed in the frameworks of |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE |
Abstract: Existence and reconstruction issues are considered for a class of (0,1)-matrices with different rows.
Intending to define quantitative characteristics, maximization of which lead to matrice |
| F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY | Article |
CLASSIFICATION RESULTS FOR (v, k, 1) CYCLIC DIFFERENCE FAMILIES WITH SMALL ... |
Abstract: Classifications of (v, k, 1) cyclic difference families (CDFs) by other authors are known for k = 3 and
v 57, k = 4 and v 64, k = 5 and v 65, k = 6 and v = 91 and k = 7 and v = 91. In |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 |
Abstract: Let ܥ be a collection of objects, characterized by the set ܣ = {ܽଵ,⋯,ܽ} of binary attributes. We
consider problems of the following type: given an object-characterization table, |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS |
Abstract: This paper considers one particular problem of general type of discrete tomography problems and
introduces an approximate algorithm for its solution based on Lagrangian relaxation. A softwa |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... |
Abstract: Many artificial intelligence problems are NP-complete ones. To increase the needed time of such a
problem solving a method of extraction of sub-formulas characterizing the common features o |
| F.2.1 Numerical Algorithms and Problems | Article |
CONSTRUCTION OF SOME COMPOSITION PERMUTATIONS VIA LINEAR TRANSLATORS |
Abstract: This paper considers construction of some composition permutation polynomials. For some
permutation polynomials the explicit view of their self-compositions and inverse mappings are given. |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES |
Abstract: We consider ܦ ,(݊)the set of all degree sequences of simple hypergraphs with ݊ vertices
and ݉ hyperedges. We show that ܦ ,(݊)which is a subset of the ݊-dimensional ݉+1-valued |
| F.2.1 Numerical Algorithms and Problems | Article |
DIFFERENTIAL EVOLUTION – PARTICLE SWARM OPTIMIZATION |
Abstract: This paper shows the Particle Swarm Optimization algorithm with a Differential Evolution. Each candidate solution is sampled uniformly in [−5,5] D, whereDdenotes the search space dimension |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
DISCRETE ARTIFICIAL INTELLIGENCE PROBLEMS AND NUMBER OF STEPS OF THEIR SOLUTION |
Abstract: Aggregate characteristics of discrete models appearing in different artificial intelligence problems are considered. It is shown that if an investigated object is a collection of its element |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE RECOGNITION PROBLEM |
Abstract: Pattern recognition problem using properties of parts of a recognizable objects and relations between
them is NP-hard. That is why quick recognition of an object with many elements is a dif |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ... |
Abstract: An approximation greedy algorithm is considered for reconstruction of (0,1)-matrices with different rows. Numbers of pairs of different rows is taken up as a quantitative characteristic, max |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION |
Abstract: In this paper we present some research results and propose solutions for natural language string
lookup techniques. In particular a fast method is suggested for searching dictionary entries |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS |
Abstract: We propose the adaptive algorithm for solving a set of similar scheduling problems using learning
technology. It is devised to combine the merits of an exact algorithm based on the mixed gr |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY |
Abstract: A special quality of discrete tomography problem solutions that requires the ray difference is
considered. Two classes of reconstruction tasks of (0,1)-matrices with different rows are stud |
| F.2.1 Numerical Algorithms and Problems | Article |
MATRICIAL MODEL FOR THE STUDY OF LOWER BOUNDS |
Abstract: Let V be an array. The range query problem concerns the design of data structures for implementing
the following operations. The operation update(j,x) has the effect v v x j j ← + , and t |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
ON STRUCTURAL RECOGNITION WITH LOGIC AND DISCRETE ANALYSIS |
Abstract: The paper addresses issues of special style structuring of learning set in pattern recognition area. Above the regular means of ranking of objects and properties, which also use the structur |
| F.2.1 Numerical Algorithms and Problems | Article |
ON THE COMPLEXITY OF SEARCH FOR CONJUNCTIVE RULES IN RECOGNITION PROBLEMS |
Abstract: New results are obtained in logical data analysis and in the development of recognition procedures
based on constructing conjunctive rules. Asymptotically optimal methods of constructing no |
| F.2.1 Numerical Algorithms and Problems | Article |
OPTIMAL CONTROL OF A SECOND ORDER PARABOLIC HEAT EQUATION |
Abstract: In this paper, we are concerned with the optimal control boundary control of a second order parabolic
heat equation. Using the results in [Evtushenko, 1997] and spatial central finite diffe |
| F.2.m Miscellaneous | Article |
POLYNOMIAL-TIME EFFECTIVENESS OF PASCAL, TURBO PROLOG, VISUAL PROLOG AND ... |
Abstract: An analysis of distinctions between a mathematical notion of an algorithm and a program is presented
in the paper. The notions of the number of steps and the run used memory size for a Pasc |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
REALIZATION OF AN OPTIMAL SCHEDULE FOR THE TWO-MACHINE |
Abstract: Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs
is studied. In an uncertain version of a scheduling problem, there may not exist a unique s |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
RECENT RESULTS ON STABILITY ANALYSIS ... |
Abstract: Two assembly line balancing problems are addressed. The first problem (called SALBP-1) is to
minimize number of linearly ordered stations for processing n partially ordered operations V = { |
Wiki
