87 search results - page 3 / 18 » A Theoretical Comparison of Monte Carlo Radiosity Algorithms |
PCI
2001
Springer
13 years 9 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
JCC
2006
13 years 5 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
RT
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
ENC
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper presents the main multiobjective optimization concepts that have been used in evolutionary algorithms to handle constraints in global optimization problems. A review of...
NLP
2000
13 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...