832 search results - page 161 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
CPHYSICS
2004
14 years 9 months ago
2004
We present a hybrid kinetic-MHD model consisting of 3 species, the bulk fluid ions and electrons, and a kinetic minority hot particle species. The 3 species equations are derived ...
NIPS
1996
14 years 11 months ago
1996
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...
116
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
CC
2007
Springer
14 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
IJRR
2010
14 years 8 months ago
2010
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...