4217 search results - page 33 / 844 » The Small Model Property: How Small Can It Be |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
CIE
2010
Springer
14 years 26 days ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
AIPS
2010
13 years 11 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
APN
2010
Springer
14 years 1 months ago
2010
Springer
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
SIGMETRICS
2005
ACM
14 years 2 months ago
2005
ACM
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures ...