In this paper we present a multilevel ant-colony optimization algorithm, which is a relatively new metaheuristic technique for solving combinatorial optimization problems. We apply this algorithm to the mesh partitioning problem, which is an important problem with extensive applications in various real world engineering problems. The algorithm outperforms the classical kMETIS and Chaco algorith...

In this paper we provide a combinatorial framework for analysing the performance of frequency hopping sequences in a multiple access system in the presence of a communication jammer. We examine the resilience of a scheme based on Latin squares which achieves maximum throughput and propose further schemes with the same throughput but better resilience. We also consider the parameters and trade-o...

-. Starting from steps of length h/me and time intervals h/mc2, which imply a quasi-local Zitterbewe.quny with velocity steps fc, we employ discrimination between bit-strings of finite length to construct a necessarily 3+1 dimensional eventspace for relativistic quantum mechanics. By using the combinatorial hierarchy to label the strings, we provide a successful start on constructing the coupli...

In this paper we present an extension of MAX{MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modiied choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to eeciently nd near optimal solutions to hard combinatorial op...

We consider systems of recursively defined combinatorial structures. We present a quadratic iterative method solving these systems when they are well founded. From there, we deduce truncations of the corresponding generating series in quasi-optimal complexity. This iteration transfers to a numerical scheme that converges unconditionally to the values of the generating series inside their disk o...

In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...

This paper describes a modification of the conventional M-ary Differential Phase Shift Keying MDPSK scheme. This method reduces the number of phases which improves the performance of the system by applying a mathematical method from the combinatorial theory called Balanced Incomplete Block Design BIB-design. It is a coding modulation technique in which the signal is represented by a set of phas...

A new set of tableaux indexing the weights of the irreducible representations of SO(2n + 1) is presented. These tableaux are used to produce an insertion scheme which gives a combinatorial description of the decomposition of the kth tensor power of the natural action of SO(2n + I ) into irreducibles. In particular, the multiplicities in this decomposition are described explicitly. C 1990 Academ...

We have already proposed a similarity-based mating scheme to recombine extreme and similar parents for evolutionary multiobjective optimization. In this paper, we examine the effect of the similarity-based mating scheme on the performance of evolutionary multiobjective optimization (EMO) algorithms. First we examine which is better between recombining similar or dissimilar parents. Next we exam...

We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud an...