Sciweavers

1554 search results - page 170 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 3 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
137
Voted
ESANN
2007
15 years 4 months ago
Adaptive Global Metamodeling with Neural Networks
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
Dirk Gorissen, Wouter Hendrickx, Tom Dhaene
126
Voted
CGF
2008
109views more  CGF 2008»
15 years 3 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
EC
2000
187views ECommerce» more  EC 2000»
15 years 3 months ago
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele
132
Voted
NIPS
1998
15 years 4 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh