494 search results - page 40 / 99 » Probabilistic Programming in Anglican |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
69
Voted
LCPC
2001
Springer
15 years 2 months ago
2001
Springer
Information gathered by the existing pointer analysis techniques can be classified as must aliases or definitely-points-to relationships, which hold for all executions, and may a...
AAAI
1998
14 years 11 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
75
Voted
JAIR
2007
14 years 10 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...