Sciweavers

25 search results - page 4 / 5
» Weighted Boolean Formula Games
Sort
View
EWCBR
2008
Springer
14 years 3 days ago
Discovering Feature Weights for Feature-based Indexing of Q-tables
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...
Chad Hogg, Stephen Lee-Urban, Bryan Auslander, H&e...
STACS
2001
Springer
14 years 2 months ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
ICMLA
2010
13 years 8 months ago
Heuristic Method for Discriminative Structure Learning of Markov Logic Networks
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
Quang-Thang Dinh, Matthieu Exbrayat, Christel Vrai...
WINE
2010
Springer
201views Economy» more  WINE 2010»
13 years 8 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller