14774 search results - page 275 / 2955 » Computational complexity and evolutionary computation |
153
click to vote
ALENEX
2004
15 years 8 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
171
click to vote
CGVR
2006
15 years 8 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
166
click to vote
WSC
1997
15 years 8 months ago
1997
A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, an...
151
click to vote
AMC
2007
15 years 6 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...