337 search results - page 47 / 68 » Run-Time Methods for Parallelizing Partially Parallel Loops |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
CCGRID
2005
IEEE
14 years 1 months ago
2005
IEEE
— This article presents an evolution of classical SPMD programming for clusters and grids. It is named ”Object-Oriented SPMD” as it is based on remote method invocation. More...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
NC
2006
13 years 7 months ago
2006
A monomer structure based on a hairpin loop is described that can be linked via short oligonucleotide sequences (linkers) to form polymers. Independence of linked monomers allow fo...
COMPUTING
1999
13 years 7 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...