Sciweavers

832 search results - page 30 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
IPPS
2003
IEEE
15 years 2 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
SBACPAD
2004
IEEE
83views Hardware» more  SBACPAD 2004»
14 years 11 months ago
Parallel Adaptive Mesh Coarsening for Seismic Tomography
Seismic tomography enables to model the internal structure of the Earth. In order to improve the precision of existing models, a huge amount of acquired seismic data must be analy...
Marc Grunberg, Stéphane Genaud, Catherine M...
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
SPDP
1991
IEEE
15 years 1 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
INFOCOM
2008
IEEE
15 years 4 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen