This article describes an approach to solving distributed constraint optimization problems (DCOP) with n-ary constraints. A key instance of this problem is distributed resource-constrained task scheduling, in which limited resource capacities implicitly imply n-ary relations among the start-times of the tasks. We describe ADOPT-N, an extension of ADOPT [16], a recent successful algorithm for DC...

Transform domain communication system (TDCS) has been proposed as a new kind of intelligent wireless communication system, which has the advantages of adaptive interference avoidance capability and low probability of intercept (LPI). Different from the traditional communication system suppressing interference at the receiver, TDCS synthesizes an adaptive fundamental modulation waveform (FMW) in...

in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

Abstract Isotopies and autotopies of n -ary groups are described. As a consequence, we obtain various characterizations the group automorphisms groups. We also determine number given group.