29 search results - page 3 / 6 » LU-GPU: Efficient Algorithms for Solving Dense Linear System... |
DAC
2002
ACM
14 years 6 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
ISCA
2002
IEEE
13 years 5 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
CSCLP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
AMDO
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...