This is TikiWiki v1.9.8.3 -Sirius- © 2002–2007 by the Tiki community Mon 29 of Apr, 2024 [19:19 UTC]
Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats

Category F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY

Browse in:
All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles

search category: deep:

Hide subcategories objects

Current category: Top  ::  ITHEA Classification Structure  ::  F. Theory of Computation  ::  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
..
 

Objects (38)

F.2.1 Numerical Algorithms and Problems 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.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.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.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.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY Article ЗАДАЧИ ПОМЕХОУСТОЙЧИВОГО АНАЛИЗА И РАСПОЗН Аннотация: Рассматриваются некоторые задачи помехоустойчивого off-line анализа и распознавания числовых и век� 
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY Article О НЕКОТОРЫХ ТРУДНОРЕШАЕМЫХ ЗАДАЧАХ ПОМЕХОУ Аннотация: Рассматриваются дискретные экстремальные задачи, к которым сводятся некоторые варианты проблем� 
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY Article ОБ ОДНОЙ ЗАДАЧЕ РАСПОЗНАВАНИЯ ПОСЛЕДОВАТЕЛ Аннотация: Рассматривается дискретная экстремальная задача, к которой сводится один из вариантов проблемы � 

[prev]  Page: 2/2
1   2  
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.23 secs ]   [ Memory usage: 9.10MB ]   [ GZIP Disabled ]   [ Server load: 0.32 ]