| F.1.1 Models of Computation | Article |
NEURAL CONTROL OF CHAOS AND APLICATIONS |
Abstract: Signal processing is an important topic in technological research today. In the areas of nonlinear
dynamics search, the endeavor to control or order chaos is an issue that has received incr |
| F.4.0 General | Article |
NON-LINEAR NETWORK-FLOW MODEL OF ŁUKASIEWICZ’S MULTIVALUE LOGIC |
Abstract: The paper presents a new network-flow interpretation of Łukasiewicz’s logic based on models with an
increased effectiveness. The obtained results show that the presented network-flow mod |
| F.1.2 Modes of Computation | Article |
NUMERICAL INTEGRATION BY GENETIC ALGORITHMS |
Abstract: It is shown that genetic algorithms can be used successfully in problems of definite integral calculation
especially when an integrand has a primitive which can't be expressed analytically |
| F.1.3 Complexity Measures and Classes | Article |
ON HYPERSIMPLE wtt -MITOTIC SETS, WHICH ARE NOT tt -MITOTIC |
Abstract: A Т-complete wtt-mitotic set is composed, which is not tt-mitotic. A relation is found out between
structure of computably enumerable sets and the density of their unsolvability degrees.
|
| F.4.1 Mathematical Logic | 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 |
| 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.1.1 Models of Computation | Article |
POLYNOMIAL APPROXIMATION USING PARTICLE SWARM OPTIMIZATION OF LINEAR ... |
Abstract: This paper presents some ideas about a new neural network architecture that can be compared to a Taylor
analysis when dealing with patterns. Such architecture is based on lineal activation |
| F.1.1 Models of Computation | Article |
Polynomial Regression using a Perceptron with Axo-axonic Connections |
Abstract: Social behavior is mainly based on swarm colonies, in which each individual shares its knowledge about
the environment with other individuals to get optimal solutions. Such co-operative mod |
| 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.1.1 Models of Computation | Article |
PRION CRYSTALIZATION MODEL AND ITS APPLICATION TO RECOGNITION PATTERN |
Abstract: This paper introduces APA (“Artificial Prion Assembly”): a pattern recognition system based on artificial
prion crystalization. Specifically, the system exhibits the capability to class |
| F.3.1 Specifying and Verifying and Reasoning about Programs | Article |
Program Invariants Generation over Polynomial Ring using Iterative Methods. |
Abstract: A solution for program polynomial invariant generation problem is presented. An iteration upper approximation method that was successfully applied on free algebras in this paper was adopted |
| F.4.1 Mathematical Logic | Article |
PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT ... |
Abstract: In this paper the proof complexities of some classes of quasi-hard determinable (Tsgfn ) and hard
determinable ( n ) formulas are investigated in some refutation propositional systems. I |
| F.4.1 Mathematical Logic | Article |
PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT ... |
Abstract: In this paper the proof complexities of some classes of quasi-hard determinable (Tsgf n ) and hard
determinable (ψ n ) formulas are investigated in some refutation propositional systems. I |
| F.3.1 Specifying and Verifying and Reasoning about Programs | Article |
PROPERTIES PROOF METHOD IN IPCL APPLICATION TO REAL-WORLD SYSTEM CORRECTNESS ... |
Abstract: The correctness proof for programs with parallelism, and interleaving concurrency with
shared memory in particular, is complicated problem because the state of separate execution thread
ca |
| 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 = { |
| F.1.3 Complexity Measures and Classes | Article |
Review of some problems on the complexity of simultaneous divisibility of linear |
Abstract: An introduction to the problems considering complexity of simultaneous divisibilities of values
of linear polynomials is presented. Some history facts, recent results and open questions tha |
| F.2.1 Numerical Algorithms and Problems | Article |
SELECTING CLASSIFIERS TECHNIQUES FOR OUTCOME PREDICTION ... |
Abstract: This paper presents an analysis of different techniques that is designed to aid a researcher in
determining which of the classification techniques would be most appropriate to choose the ri |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
SELF-MODIFICATED PREDICATE NETWORKS |
Abstract: A model of self-modificated predicate network with cells implementing predicate formulas in
the form of elementary conjunction is suggested. Unlike a classical neuron network the proposed m |
| F.1.1 Models of Computation | Article |
Self-Organizing Architectural design based on Morphogenetic Programming |
Abstract: In this paper we propose the use of Networks of Bio-inspired Processors (NBP) to model some
biological phenomena within a computational framework. In particular, we propose the use of an ex |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ... |
Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single
machine with minimizing the weighted total flow time, provided that processing time of a job |
| F.1.1 Models of Computation | Article |
SIMULTANEOUS CONTROL OF CHAOTIC SYSTEMS USING RBF NETWORKS |
Abstract: Chaos control is a concept that recently acquiring more attention among the research community,
concerning the fields of engineering, physics, chemistry, biology and mathematic. This paper |
Wiki
