Abstract: Example methods and systems for assigning tasks to balloons within a balloon network are described. One example system includes a first sub-fleet of balloons assigned a first set of one or more tasks within a balloon network, a second sub-fleet of balloons assigned a second set of one or more tasks within the balloon network, and a control system configured to determine that a first balloon in the first sub-fleet of balloons initially has a predicted failure mode that corresponds to the first set of tasks, subsequently determine that the first balloon has a predicted failure mode that corresponds to the second set of tasks, and reassign the first balloon from the first sub-fleet of balloons to the second sub-fleet of balloons.

Abstract: A method, apparatus and computer program product for performing probabilistic inference and providing related solution methods is presented. At least one state space (SS) is obtained for variables of interest relating to a problem of interest. None or more densities (D) defining pure functions over locations in the at least one SS are also obtained as is none or more kernels (K) defining a stochastic walk through the at least one SS. A virtual machine executes a stochastic walk through the state space to produce a solution for a problem of interest.

Abstract: A method, apparatus and computer program product for performing probabilistic inference and providing related solution methods is presented. At least one state space (SS) is obtained for variables of interest relating to a problem of interest. None or more densities (D) defining pure functions over locations in the at least one SS are also obtained as is none or more kernels (K) defining a stochastic walk through the at least one SS. A virtual machine executes a stochastic walk through the state space to produce a solution for a problem of interest.