This paper deals with the construction of binary sequences with low autocorrelation, a very hard problem with many practical applications. The paper analyzes several metaheuristic approaches to tackle this kind of sequences. More specifically, the paper provides an analysis of different local search strategies, used as standalone techniques and embedded within memetic algorithms. One of our pro...

we obtain the expression of ricci tensor for a $gcr$-lightlikesubmanifold of indefinite complex space form and discuss itsproperties on a totally geodesic $gcr$-lightlike submanifold of anindefinite complex space form. moreover, we have proved that everyproper totally umbilical $gcr$-lightlike submanifold of anindefinite kaehler manifold is a totally geodesic $gcr$-lightlikesubmanifold.

the present paper introduces the notion of the complete fuzzy norm on a linear space. and, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. some characterizations of their properties are obtained.

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

Automated theorem proving with connection tableau calculi imposes search problems in tremendous search spaces. In this paper, we present a new approach to search space reduction in connection tableau calculi. In our approach structurally similar parts of the search space are compressed by means of disjunctive constraints. We describe the necessary changes of the calculus, and we develop elabora...

Many planning systems operate by performing a heuristic forward search in the problem state space. In large problems that approach fails, exhausting a computer’s memory due to the burden of storing problem states. Moreover, it is an open question exactly how that approach should be parallelized to take advantage of modern multiple-processor computers and the proliferation of massively parallel ...

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...