F.1.1 Models of Computation	Article	SOLVING A DIRECT MARKETING PROBLEM BY THREE TYPES OF ARTMAP NEURAL NETWORKS	Abstract: An important task for a direct mailing company is to detect potential customers in order to avoid unnecessary and unwanted mailing. This paper describes a non-linear method to predict profi
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY	Article	SOME METHODOLOGICAL APPROACHES TO THE PROBLEM OF "UNDERSTANDING THE UNDERSTANDIN	Summary: Certain methodological questions of description and research such a complex object (and process!) as “comprehention/understanding” are described: the levels, structure, mechanisms of co
F.1.1 Models of Computation	Article	STATIC ANALYSIS OF USEFULNESS STATES IN TRANSITION P SYSTEMS	Abstract: Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of
F.1.1 Models of Computation	Article	STRING MEASURE APPLIED TO STRING SELF-ORGANIZING MAPS AND NETWORKS OF ...	Abstract: This paper shows some ideas about how to incorporate a string learning stage in self-organizing algorithms. T. Kohonen and P. Somervuo have shown that self-organizing maps (SOM) are not res
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY	Article	SYSTEM MODIFICATION MODEL CREATING SYNTHESIS FOR ALGORITHM FORMULAS	Abstract: An analysis of the basic system for the synthesis of formulas of algebra algorithms was conducted The need for a construction of an expanded system for computer synthesis that would allow s
F.2.m Miscellaneous	Article	SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY	Abstract: Series of problems concerning systems of linear Diophantine equations and dis-equations with explicitly given parameters are offered below. For every problem from a series the conditions up
F.2.2 Nonnumerical Algorithms and Problems	Article	THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH DECREASING	Abstract: Algorithms for soling artificial intelligence problems allowing to formalize by means of predicate language are presented in the paper. These algorithms use the modified Maslov’s inverse
F.2.2 Nonnumerical Algorithms and Problems	Article	THE INVERSE METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN ...	Abstract: The paper is devoted to the modifying of Maslov inverse method for a special form of predicate formulas used in the solution of artificial intelligence problems. An algorithm of the inverse
F.2.1 Numerical Algorithms and Problems	Article	THE NEW SOFTWARE PACKAGE FOR DYNAMIC HIERARCHICAL CLUSTERING ...	Abstract: In data mining, efforts have focused on finding methods for efficient and effective cluster analysis in large databases. Active themes of research focus on the scalability of clustering met
F.1.1 Models of Computation	Article	TIMED TRANSITION AUTOMATA AS NUMERICAL PLANNING DOMAIN	Abstract: A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automat
F.4.1 Mathematical Logic	Article	UNIVERSAL AND DETERMINED CONSTRUCTORS OF MULTISETS OF OBJECTS	Abstract: This paper contains analysis of creation of sets and multisets as an approach for modeling of some aspects of human thinking. The creation of sets is considered within constructive object-o
F.1.2 Modes of Computation	Article	WEBCOMPUTING SERVICE FRAMEWORK	Abstract: Presented is webComputing – a general framework of mathematically oriented services including remote access to hardware and software resources for mathematical computations, and web inter
F.4.3 Formal Languages	Article	АКСИОМАТИЧЕСКИЙ ПОДХОД К СУЖЕНИЮ МНОЖЕСТВА	Аннотация: Обсуждаются вычислительные аспекты аксиоматического подхода к решению проблемы сужения множест
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY	Article	ЗАДАЧИ ПОМЕХОУСТОЙЧИВОГО АНАЛИЗА И РАСПОЗН	Аннотация: Рассматриваются некоторые задачи помехоустойчивого off-line анализа и распознавания числовых и век�
F.3.1 Specifying and Verifying and Reasoning about Programs	Article	МНОГОСОРТНАЯ МОНОТОННАЯ ЛОГИКА ФЛОЙДА-ХОАР	Аннотация: Рассматривается проблема построения монотонной логики Флойда-Хоара, которая является расширени�
F.3.1 Specifying and Verifying and Reasoning about Programs	Article	МОДАЛЬНЫЕ ЛОГИКИ ЧАСТИЧНЫХ ПРЕДИКАТОВ И СЕ�	Аннотация: Исследованы программно-ориентированные логические формализмы – транзиционные композиционно-но
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY	Article	О НЕКОТОРЫХ ТРУДНОРЕШАЕМЫХ ЗАДАЧАХ ПОМЕХОУ	Аннотация: Рассматриваются дискретные экстремальные задачи, к которым сводятся некоторые варианты проблем�
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY	Article	ОБ ОДНОЙ ЗАДАЧЕ РАСПОЗНАВАНИЯ ПОСЛЕДОВАТЕЛ	Аннотация: Рассматривается дискретная экстремальная задача, к которой сводится один из вариантов проблемы �
F.3.1 Specifying and Verifying and Reasoning about Programs	Article	СЕМАНТИЧЕСКИЕ СВОЙСТВА И СЕКВЕНЦИАЛЬНЫЕ ИС	Аннотация: Исследованы чистые первопорядковые композиционно-номинативные логики частичных однозначных пр�
F.4.3 Formal Languages	Article	СУЖЕНИЕ МНОЖЕСТВА ПАРЕТО НА ОСНОВЕ НЕЧЁТКОЙ ИНФОРМАЦИИ	Аннотация: Обсуждается аксиоматический подход к решению проблемы сужения множества Парето на основе нечётк

[prev] Page: 4/4
1 2 3 4

World Clock

Wiki

Blogs

Articles

Image Galleries

File Galleries

Forums

Maps

Calendars

[ Execution time: 0.25 secs ] [ Memory usage: 9.11MB ] [ GZIP Disabled ] [ Server load: 0.52 ]