2957 search results - page 434 / 592 » The Complexity of Polynomial-Time Approximation |
ICCAD
1993
IEEE
14 years 2 months ago
1993
IEEE
For submicron integrated circuits, 3D numerical techniques are required to accurately compute the values of the interconnect capacitances. In this paper, we describe an hierarchic...
SIGGRAPH
1994
ACM
14 years 2 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
RT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We present a new hybrid rendering method for interactive walkthroughs in photometrically complex environments. The display process starts from some approximation of the s...