2092 search results - page 200 / 419 » A Theory of Non-Deterministic Networks |
PDC
2004
ACM
15 years 5 months ago
2004
ACM
This paper describes and analyses the early developmental stages of a community learning network based in an urban community and social service agency. With government funding, th...
130
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
106
click to vote
SIROCCO
2008
15 years 1 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
109
click to vote
ACSW
2006
15 years 1 months ago
2006
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
UAI
2003
15 years 1 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...