We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
In this paper we study the use of experts algorithms in a multiagent setting. In this paper we allow agents to use multiple experts and explore different experts algorithms that a...
The organizational algorithm is examined as a computational approach to representing interpersonal learning. The structure of the algorithm is introduced and described in context ...
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...