Sciweavers

8298 search results - page 329 / 1660
» On the Complexity of Numerical Analysis
Sort
View
WSC
2007
15 years 9 months ago
Sensitivity estimates from characteristic functions
We investigate the application of the likelihood ratio method (LRM) for sensitivity estimation when the relevant density for the underlying model is known only through its charact...
Paul Glasserman, Zongjian Liu
203
Voted
FLAIRS
2000
15 years 8 months ago
A Deterministic Algorithm for Solving Imprecise Decision Problems
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...
Håkan L. S. Younes, Love Ekenberg
WSC
1997
15 years 8 months ago
New Development of Optimal Computing Budget Allocation for Discrete Event Simulation
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
Hsiao-Chang Chen, Chun-Hung Chen, Liyi Dai, Enver ...
172
Voted
CGF
2008
114views more  CGF 2008»
15 years 7 months ago
Real-time Shading with Filtered Importance Sampling
We propose an analysis of numerical integration based on sampling theory, whereby the integration error caused by aliasing is suppressed by pre-filtering. We derive a pre-filter f...
Jaroslav Krivánek, Mark Colbert
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher