The assignment of alternatives (observations/objects) into predefined homogenous groups is a problem of major practical and research interest. This type of problem is referred to ...
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
We discuss the tradeo s involved in control of complex articulated agents, and present three implemented controllers for a complex task: a physically-based humanoid torso dancing ...
Maja J. Mataric, Victor B. Zordan, Matthew M. Will...
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...