Sciweavers

1594 search results - page 108 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
IJHPCA
2006
99views more  IJHPCA 2006»
15 years 3 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 9 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ICPR
2008
IEEE
15 years 9 months ago
Cellular automaton for ultra-fast watershed transform on GPU
In this paper we describe a cellular automaton (CA) used to perform the watershed transform in N-D images. Our method is based on image integration via the Ford-Bellman shortest p...
Claude Kauffmann, Nicolas Piche
CCGRID
2010
IEEE
15 years 4 months ago
Topology Aggregation for E-science Networks
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 3 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli