409 search results - page 45 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
IJAR
2010
14 years 8 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
SIGECOM
2010
ACM
14 years 9 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
IJAR
2008
14 years 9 months ago
2008
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...