Sciweavers

1167 search results - page 29 / 234
» Relational Markov Games
Sort
View
EJC
2007
14 years 9 months ago
Hypertree width and related hypergraph invariants
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Isolde Adler, Georg Gottlob, Martin Grohe
75
Voted
GROUP
2009
ACM
15 years 4 months ago
Usability heuristics for networked multiplayer games
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...
71
Voted
ICDM
2003
IEEE
118views Data Mining» more  ICDM 2003»
15 years 2 months ago
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains
In this work, we show that Kleinberg’s hubs and authorities model is closely related to both correspondence analysis, a well-known multivariate statistical technique, and a parti...
François Fouss, Marco Saerens, Jean-Michel ...
91
Voted
AAAI
2007
14 years 12 months ago
Mapping and Revising Markov Logic Networks for Transfer Learning
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...
64
Voted
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 11 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...