F.4.2 Grammars and Other Rewriting Systems | Article |
DERIVATION OF CONTEXT-FREE STOCHASTIC L-GRAMMAR RULES ... |
Abstract: Formal grammars can used for describing complex repeatable structures such as DNA sequences. In
this paper, we describe the structural composition of DNA sequences using a context-free stoc |
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.1 COMPUTATION BY ABSTRACT DEVICES | Article |
EVOLVING CASCADE NEURAL NETWORK BASED ON MULTIDIMESNIONAL EPANECHNIKOV’S ... |
Abstract: At present time neural networks based on Group Method of Data Handling (GMDH-NN), nodes of which are two-input N-Adalines, is well-known. Each of N-Adalines contains the set of adjustable sy |
F.1.2 Modes of Computation | Article |
EXTENDED NETWORKS OF EVOLUTIONARY PROCESSORS |
Abstract: This paper presents an extended behavior of networks of evolutionary processors. Usually, such nets
are able to solve NP-complete problems working with symbolic information. Information can |
F.1.2 Modes of Computation | Article |
EXTENDED NETWORKS OF EVOLUTIONARY PROCESSORS |
Abstract: This paper presents an extended behavior of networks of evolutionary processors. Usually, such nets are able to solve NP-complete problems working with symbolic information. Information can |
F.1.1 Models of Computation | Article |
FILTERED NETWORKS OF EVOLUTIONARY PROCESSORS* |
Abstract: This paper presents some connectionist models that are widely used to solve NP-problems. Most well
known numeric models are Neural Networks that are able to approximate any function or clas |
F.1 COMPUTATION BY ABSTRACT DEVICES | Article |
GENERAL REGRESSION NEURO–FUZZY NETWORK FOR IDENTIFICATION ... |
Abstract: General Regression Neuro-Fuzzy Network, which combines the properties of conventional General
Regression Neural Network and Adaptive Network-based Fuzzy Inference System is proposed in this |
F.4.3 Formal Languages | Article |
GENERALIZED AXIOMATIC APPROACH TO THE PARETO SET NARROWING |
Abstract: An axiomatic approach to solve the problem of narrowing the Pareto set based on some numerical
information regarding preferences of the decision maker is considered. This approach has been |
F.4.3 Formal Languages | Article |
Generalized Axiomatic Approach to the Pareto Set Narrowing |
Abstract: An axiomatic approach to solve the problem of narrowing the Pareto set based on some numerical
information regarding preferences of the decision maker is considered. This approach has been |
F.1.1 Models of Computation | Article |
GENERALIZING OF NEURAL NETS: FUNCTIONAL NETS OF SPECIAL TYPE |
Abstract: Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report.
Such refinement touch upon the constituent elements for the conception of ar |
F.1.1 Models of Computation | Article |
GENETIC BASED SPOT DETECTION METHOD IN TWO-DIMENSIONAL ELECTROPHORESIS IMAGES |
Abstract: The image analysis of two-dimensional electrophoresis images is a difficult task were authors were not able to find any other work in the literature handling with evolutionary computation in |
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.1.1 Models of Computation | Article |
INTELLIGENT TRADING SYSTEMS |
Abstract: During last 50 years, the markets have been object of study. Technical and fundamental
indicators have been used to try to predict the behavior of the market and then execute buying or sell |
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.1.2 Modes of Computation | Article |
MEMBRANES DISTRIBUTION USING GENETIC ALGORITHMS |
Abstract: Membrane computing is an area of natural computing, which solves NP-complete problems simulating
permeability of live cells membranes. Different researchers have developed architectures to |
F. Theory of Computation | Article |
METHOD AND ALGORITHM FOR MINIMIZATION OF PROBABILISTIC AUTOMATA |
Abstract: The theory of probabilistic automata is still evolving discipline of theory of information. As in classical theory of automata, it might be a base for computations, can be exploited in desig |
F. Theory of Computation | Article |
MINIMIZATION OF REACTIVE PROBABILISTIC AUTOMATA |
Abstract: The problem of finite automata minimization is important for software and hardware designing. Different
types of automata are used for modeling systems or machines with finite number of sta |
F.1.1 Models of Computation | Article |
MULTIPLE-MODEL DESCRIPTION AND STRUCTURE DYNAMICS ANALYSIS OF ACTIVE MOVING... |
Abstract: Proposed developed concept of active moving object (AMO) was used to form statement of control
problems which was investigated. Depending on the type of AMO can move and interact in space, |
F.1.2 Modes of Computation | Article |
NETWORKS OF EVOLUTIONARY PROCESSORS (NEP) AS DECISION SUPPORT SYSTEMS1 |
Abstract: This paper presents the application of Networks of Evolutionary Processors to Decision Support
Systems, precisely Knowledge-Driven DSS. Symbolic information and rule-based behavior in Netwo |
F.1.2 Modes of Computation | Article |
NETWORKS OF EVOLUTIONARY PROCESSORS: JAVA IMPLEMENTATION ... |
Abstract: This paper is focused on a parallel JAVA implementation of a processor defined in a Network of
Evolutionary Processors. Processor description is based on JDom, which provides a complete, Ja |