914 search results - page 103 / 183 » The Computational Complexity of Probabilistic Planning |
110
click to vote
DIS
2009
Springer
15 years 3 months ago
2009
Springer
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
FOCI
2007
IEEE
15 years 6 months ago
2007
IEEE
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
118
click to vote
ESCIENCE
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper discusses the process of building an environment where large-scale, complex, scientific analysis can be scheduled onto a heterogeneous collection of computational and s...
109
click to vote
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...