5785 search results - page 298 / 1157 » Approximability of Probability Distributions |
127
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
135
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
148
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
150
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
137
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...