Given a complete directed graph G with weights on the vertices and on the arcs, a θ-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of every vertex v is greater, by a given factor 1 θ , than the sum of the weights on the arcs (u, v) entering v with the tail u of the same color as v. For a given real number θ and an integer k, the Part...

A memetic algorithm (MA), i.e. an evolutionary algorithm making use of local search, for the quadratic assignment problem is presented. A new recombination operator for realizing the approach is described, and the behavior of the MA is investigated on a set of problem instances containing between 25 and 100 facilities/locations. The results indicate that the proposed MA is able to produce high ...

The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both in the forma analysis framework, and in the decoder paradigm. All approaches are studied from the point of view of two different quality measures of assignments: the number of distinct frequencies, and the frequency span. It is ...

The comparison and matching based on partial description of the 3D model is the current focus of study in the shape analysis. The partial description based on the eigenfunction of the Laplace-Beltrami operator is an important way. A large number of eigenfunction values of any point on the surface of the model form a eigenvector; based on this vector, K-means clustering method will be used to qu...

A new combination rule based on specified fuzzy T-Conorm/T-Norm operators is proposed and analyzed in this article the TCN Rule of Combination. The rule does not belong to the general Weighted Operator Class. The advantages of the new rule could be defined as: very easy to implement, satisfying the impact of neutrality of Vacuous Belief Assignment, commutative, convergent to idempotence, reflec...

Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on...

The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution ...

This paper presents a solution for the Class Responsibility Assignment Case of the 2016 Transformation Tool Contest. The task is to assign features (methods and attributes with dependencies to each other) to classes and optimize a software metric called CRA-Index. The solution utilizes the rule-based design space exploration framework Viatra-DSE with the Non-dominated Sorting Genetic Algorithm ...

A basic belief assignment can have up to 2 focal elements, and combining them with a simple conjunctive operator will need O(2) operations. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The first section revisits some well-known definitions with an algorithmic point of vue. The se...

Interference is one of the major causes for performance degradation in wireless networks. Channel assignment algorithms have been proven successful to decrease the networkwide interference by using non-overlapping channels for otherwise interfering links. However, external co-located networks and devices are usually not considered in the channel assignment procedure, since they are not under th...