We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
We generalize our results of [8, 9] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree...
Yan Huang, Ilya Pollak, Minh N. Do, Charles A. Bou...
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...