An agglomerative method for automatic forming of hierarchical classification
An algebraic approach to Pólya processes
Pólya processes are natural generalizations of Pólya–Eggenberger urn models. This article presents a new approach of their asymptotic behaviour via moments, based on the spectral decomposition of a suitable finite difference transition operator on polynomial functions. Especially, it provides new results for large processes (a Pólya process is called small when 1 is a simple eigenvalue of its replacement matrix and when any other eigenvalue has a real part ≤1/2; otherwise, it is called large).
An algorithm for calculation of (+, *) - expressions with natural numbers
An algorithm for optimal partitioning of a graph
An algorithm for reduction of complexity of relations in a system of variables
Let us have a system of variables, among which there are complicated dependences. Assuming reflexivity and transitivity of the relation " depends on ", a simple algorithm is proposed which produces all dependences in an optimized way, without losing information.
An Algorithm for the Detection of Move Repetition Without the Use of Hash-Keys
An algorithm to calculate the kernel of certain polynomial ring homomorphisms.
An analysis of programs by algebraic means
An approach based on the use of the ant system to design combinational logic circuits.
In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a cost metric (based on the number of gates) is adopted in order to optimize the feasible circuits generated. The approach is compared to a genetic algorithm and to a human designer using several examples and the sensitivity of the algorithm to its parameters is studied using analysis of...
An approach to parallel algorithm design
An approximate difference algorithm for massive data streams.
An effective global path planning algorithm with teaching-learning-based optimization
Due to the widespread use of mobile robots in various applications, the path planning problem has emerged as one of the important research topics. Path planning is defined as finding the shortest path starting from the initial point to the destination in such a way as to get rid of the obstacles it encounters. In this study, we propose a path planning algorithm based on a teaching-learning-based optimization (TLBO) algorithm with Bezier curves in a static environment with obstacles. The proposed...
An Efficient Algorithm for Guard Placement in Polygons with Holes.
An efficient implementation of Sugiyama's algorithm for layered graph drawing.
An evolutionary approach to geometrical place problems.
An implementation of Karr's summation algorithm in Mathematica.
An implementation of the fast Givens transformations on a MIMD computer
An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups.
An Implementation of Vincent's Theorem.
An improved derandomized approximation algorithm for the max-controlled set problem
A vertex i of a graph G = (V,E) is said to be controlled by if the majority of the elements of the neighborhood of i (including itself) belong to M. The set M is a monopoly in G if every vertex is controlled by M. Given a set and two graphs G1 = () and G2 = () where , the monopoly verification problem (mvp) consists of deciding whether there exists a sandwich graph G = (V,E) (i.e., a graph where ) such that M is a monopoly in G = (V,E). If the answer to the mvp is No, we then consider...