Sciweavers

3455 search results - page 421 / 691
» Generalized Game Trees
Sort
View
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 9 months ago
Competitive contagion in networks
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...
Sanjeev Goyal, Michael Kearns
ICIP
2005
IEEE
16 years 8 months ago
Optimal representations in multitree dictionaries with application to compression
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...
PODS
2007
ACM
107views Database» more  PODS 2007»
16 years 6 months ago
Polynomial time fragments of XPath with variables
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...
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
16 years 3 months ago
Grammar Mining.
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 ...
Luc De Raedt, Siegfried Nijssen
204
Voted
CEC
2008
IEEE
16 years 1 months ago
Geometric PSO + GP = Particle Swarm Programming
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
Julian Togelius, Renzo De Nardi, Alberto Moraglio