This is TikiWiki v1.9.8.3 -Sirius- © 2002–2007 by the Tiki community Wed 18 of Sep, 2019 [08:09 UTC]
Menu

Category G.2.1 Combinatorics

Combinatorial algorithms Counting problems Generating functions Permutations and combinations Recurrences and difference equations
Browse in:
All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles

search category: deep:

Show subcategories objects

..
 

Objects (29)

Article A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM Abstract: This paper discusses the problem of determining the longest common subsequence (LCS) of two sequences. Here we view this problem in the background of the well known algorithm for the longes 
Article CHAIN SPLIT OF PARTIALLY ORDERED SET OF K-SUBSETS Abstract: An application oriented class of partially ordered sets is considered. Let P(n,k) denotes the set of all k -tuples with strictly increasing elements from the set N  {1,2,,n} and 1  
Article CHOICE OF DIAGNOSTIC DECISION MAKING IN MEDICINE AND INTERVENTION MISTAKE ... Abstract: Most processes, found in medicine, are nonlinear, chaotic, have a high level of complexity. The decisions in health care are often stereotyped, managed by habits preferences, previous exper 
Article CROSS INTERSECTION SEQUEL OF DISCRETE ISOPERIMETRY1 Abstract: This work inspired by a specifically constrained communication model. Given collections of communicating objects, and communication is by means of several relay centres. The complete cross  
Article DECOMPOSITION METHODS FOR LARGE-SCALE TSP Abstract: Decomposition methods for solving large-scale Traveling Salesman Problem (TSP) are presented. Three approaches are proposed: macromodeling for clustered TSP as well as extending and “rin 
Article DECOMPOSITION OF BOOLEAN FUNCTIONS – RECOGNIZING A GOOD SOLUTION BY TRACES Abstract: The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partitio 
Article DESCRIPTION REDUCTION FOR RESTRICTED SETS OF (0,1) MATRICES 1 Abstract: Any set system can be represented as an n -cube vertices set. Restricted sets of n -cube weighted subsets are considered. The problem considered is in simple description of all set of parti 
Article FUZZY SETS AS A MEAN FOR UNCERTAINTY HANDLING: MATH, APPLIED MATH, HEURISTICS Abstract: Number of Disciplines and Theories changed their status from status of Natural Science discipline to Mathematics. The Theory of Probability is the classical example of that kind. The main pr 
Article FUZZY SETS: MATH, APPLIED MATH, HEURISTICS? PROBLEMS AND INTERPRETATIONS Abstract: Number of Disciplines and Theories changed their status from status of Natural Science discipline to Mathematics. The Theory of Probability is the classical example of that kind. The main p 
Article GENERATING MORE BOUNDARY ELEMENTS OF SUBSET PROJECTIONS Abstract: Composition problem is considered for partition constrained vertex subsets of n dimensional unit cube En . Generating numerical characteristics of En subsets partitions is considered by mea 
Article LAGRANGEAN APPROXIMATION FOR COMBINATORIAL INVERSE PROBLEMS Abstract: Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from 
Article LOGARITHMIC DISTANCES IN GRAPHS Abstract: The walk distances in graphs are defined as the result of appropriate transformations of the P1 k=0(tA)k proximity measures, where A is the weighted adjacency matrix of a graph and t is a 
Article MULTICRITERION PROBLEMS ON THE COMBINATORIAL SET OF POLYARRANGEMENTS Abstract: The multicriterion problem of discrete optimization on the feasible combinatorial set of polyarrangements is examined. Structural properties of feasible region and different types of effici 
Article MULTICRITERION PROBLEMS ON THE COMBINATORIAL SET OF POLYARRANGEMENTS Abstract: The multicriterion problem of discrete optimization on the feasible combinatorial set of polyarrangements is examined. Structural properties of feasible region and different types of effici 
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 
Article ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS Abstract: Distance geometry consists of finding an embedding of a weighted undirected graph in Rn. Since some years, we are working on suitable discretizations for this problem. Because of the discre 
Article ON THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN BIPARTITE GRAPHS Abstract: In this paper it is shown that for bipartite graphs the structure of the family of maximum independent sets can be described constructively, in the following sense. For a bipartite graph th 
Article OPTIMIZATION OF ATM TELECOMMUNICATION NETWORKS Abstract: ATM network optimization problems defined as combinatorial optimization problems are considered. Several approximate algorithms for solving such problems are developed. Results of their com 
Article RANDOMIZED PARALLELIZATION – A NEW METHOD FOR SOLVING ... Abstract: A new method for solving some hard combinatorial optimization problems is suggested, admitting a certain reformulation. Considering such a problem, several different similar problems are pr 
Article RANDOMIZED SET SYSTEMS CONSTRAINED BY THE DISCRETE TOMOGRAPHY Abstract: This article, in general, is devoted to a set of discrete optimization issues derived from the domain of pattern recognition, machine learning and data mining - specifically. The global obj 
Article RECURRENT PROCEDURE IN SOLVING THE GROUPING INFORMATION PROBLEM IN APPLIED... Abstract: Number of The grouping information problem in its two basic manifestations recovering function, represented by empirical data (observations) and problem of classification (clusterization) a 
Article REGULAR INVERSIVE POLYTOPES Abstract: Corresponding to each regular asymptotic polytope P in hyperbolic n-space Hn is an isomorphic figure °P in inversive (n1)-space In−1 having many related metric properties. A  
Article SOLVING LARGE SYSTEMS OF BOOLEAN EQUATIONS Abstract. Systems of many Boolean equations with many variables are regarded, which have a lot of practical applications in logic design and diagnostics, pattern recognition, artificial intelligence,  
Article SOME PROPERTIES IN MULTIDIMENSIONAL MULTIVALUED DISCRETE TORUS Abstract: Current research concerns the following issues: n-dimensional discrete torus generated by cycles of even length is considered; the concept of standard arrangement in the torus is defined an 
Article SPREADING THE MOORE - PENROSE PSEUDO INVERSE ON MATRICES EUCLIDEAN SPACES: ... Abstract: In the paper the development of operating technique for matrices Euclidean spaces is represented. Particularly, within such development transfer of linear operators’ technique with preser 

Page: 1/2  [next]
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.28 secs ]   [ Memory usage: 9.11MB ]   [ GZIP Disabled ]   [ Server load: 0.28 ]