2474 search results - page 313 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
152
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
164
Voted
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
193
Voted
ICASSP
2009
IEEE
15 years 3 months ago
2009
IEEE
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
157
click to vote
IPPS
2007
IEEE
16 years 13 days ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
215
click to vote
EAGC
2004
Springer
15 years 11 months ago
2004
Springer
Problem solving using grid computing environments has become very popular amongst research groups in computation-demanding fields. This is due to the ability of Grid technologies a...