Sciweavers

925 search results - page 48 / 185
» A Solution to the Extended GCD Problem
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 22 days ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
ISPD
2004
ACM
120views Hardware» more  ISPD 2004»
14 years 1 months ago
On optimal physical synthesis of sleep transistors
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
Changbo Long, Jinjun Xiong, Lei He
ACMDIS
2000
ACM
14 years 5 days ago
Using a Technique from Graphic Designers to Develop Innovative System Designs
Rapid technological change requires that system designers explore potential design spaces widely before committing to a local design space in which to evolve a problem solution. W...
Catalina Danis, Stephen J. Boies
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 3 days ago
Test scheduling for core-based systems
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
Krishnendu Chakrabarty
ESA
2008
Springer
81views Algorithms» more  ESA 2008»
13 years 9 months ago
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
Pankaj K. Agarwal, Jeff M. Phillips