Constraint satisfaction problem (CSP) paradigm has proved highly successful for solving product configuration problems, particularly for build-to-order configuration in determining combination of different predefined component types. However, many real world customized products deal with engineer-to-order configuration, where product configuration is generated not only from combinations of diff...

The main tools in the theory of n-ary hyperstructures are the fundamental relations. The fundamental relation on an n-ary hypersemigroup is defined as the smallest equivalence relation so that the quotient would be the n-ary semigroup. In this paper we study neutral elements in n-ary hypersemigroups and introduce a new strongly compatible equivalence relation on an n-ary hypersemigroup so that ...

Ehrenfeucht. A. and R. McConnell, A k-structure generalization of the theory of 2-structures, Theoretical Computer Science 132 (1994) 209-227. The prime tree decomposition of graphs facilitates the solution of a number of important combinatorial problems. The decomposition is also known as modular decomposition and substitution decomposition. It has been generalized to 2-structures and to k-ary...

Genetic algorithms (GAs) are probabilistic search algorithms that are loosely based on biological evolution. Analyzing genetic algorithms has proven di cult, for a variety of reasons, but a landscape paradigm that rigorously models the search of GAs has become increasingly popular in their analysis. So far much of this analysis concerns binary representations, where each member of the populatio...

Abstract |We consider carrier phase and symbol timing synchronization for M-ary partial-response continuous phase modulation (CPM).We focus on developing a classical phase locked loop (PLL)-basedmethod that is robust even forM-ary partial-response CPMs, which has proven to be elusive thus far in the literature. A key part of our design is a simple yet ešective timing false lock detector, which ...

This paper introduces new type of m-ary systolic arrays called m-ary reversible systolic arrays which extends the new concept of two-valued reversible systolic arrays that was introduced in the first part of my article. The m-ary quantum systolic architectures’ computations of the new type of systolic arrays are also introduced. The new m-ary systolic arrays maintain the high level of regularit...

Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...