Sciweavers

2796 search results - page 46 / 560
» The coolest path problem
Sort
View
ICCAD
2006
IEEE
107views Hardware» more  ICCAD 2006»
15 years 10 months ago
Current path analysis for electrostatic discharge protection
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting...
121
Voted
ICCTA
2007
IEEE
15 years 8 months ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...
113
Voted
IPPS
2005
IEEE
15 years 7 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
WINE
2005
Springer
143views Economy» more  WINE 2005»
15 years 7 months ago
Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
T. S. Chandrashekar, Yadati Narahari
119
Voted
IJRR
2002
87views more  IJRR 2002»
15 years 1 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram