Sciweavers

1594 search results - page 34 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
84
Voted
ICRA
2005
IEEE
130views Robotics» more  ICRA 2005»
15 years 5 months ago
Constraint-Based Motion Planning of Deformable Robots
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
Russell Gayle, Ming C. Lin, Dinesh Manocha
DAC
2002
ACM
16 years 21 days ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
ICPP
2009
IEEE
14 years 9 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
SEFM
2008
IEEE
15 years 6 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ACSC
2003
IEEE
15 years 5 months ago
Path-Planning by Tessellation of Obstacles
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
Tane Pendragon, R. Lyndon While