A new characteristic property of the palindrome prefixes of a standard Sturmian word.
A new class of balanced search trees : half-balanced binary search tress
A new curve fitting based rating prediction algorithm for recommender systems
The most algorithms for Recommender Systems (RSs) are based on a Collaborative Filtering (CF) approach, in particular on the Probabilistic Matrix Factorization (PMF) method. It is known that the PMF method is quite successful for the rating prediction. In this study, we consider the problem of rating prediction in RSs. We propose a new algorithm which is also in the CF framework; however, it is completely different from the PMF-based algorithms. There are studies in the literature that can increase...
A new decidable Horn fragment of predicate calculus.
A new definition of the fuzzy set
The present fuzzy arithmetic based on Zadeh's possibilistic extension principle and on the classic definition of a fuzzy set has many essential drawbacks. Therefore its application to the solution of practical tasks is limited. In the paper a new definition of the fuzzy set is presented. The definition allows for a considerable fuzziness decrease in the number of arithmetic operations in comparison with the results produced by the present fuzzy arithmetic.
A New Duality Result Concerning Voronoi Diagrams.
A New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
A new evolutionary optimization technique.
A New Genetic Representation for Quadratic Assignment Problem
A new heuristic algorithm of fuzzy clustering
A new high-speed foreign fiber detection system with machine vision.
A new interpretor for PARI/GP
When Henri Cohen and his coworkers set out to write PARI twenty years ago, GP was an afterthought. While GP has become the most commonly used interface to the PARI library by a large margin, both the gp interpretor and the GP language are primitive in design. Paradoxically, while gp allows to handle very high-level objects, GP itself is a low-level language coming straight from the seventies.We rewrote GP as a compiler/evaluator pair, implementing several high-level features (statically scoped variables,...
A new lightweight method for security risk assessment based on fuzzy cognitive maps
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
A new method for web site protection and compression.
A new model of combinatorial probability
A new modeling and solution approach for the number partitioning problem.
A new possibility in bi-directional search
A new practical linear space algorithm for the longest common subsequence problem
This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths and , , on an alphabet of size , we first present an algorithm which determines the length of an LCS in time and space. This result has been achieved before [ric94,ric95], but our algorithm is significantly faster than previous methods. We also provide a second algorithm which generates an LCS in time while preserving the linear space bound, thus solving...
A new search model for evolutionary algorithms.