Sciweavers

628 search results - page 56 / 126
» Towards High-Level Programming for Distributed Problem Solvi...
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
PPOPP
2005
ACM
15 years 3 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
MOBIHOC
2006
ACM
15 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 3 months ago
An effective use of crowding distance in multiobjective particle swarm optimization
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
Carlo R. Raquel, Prospero C. Naval Jr.