Sciweavers

530 search results - page 59 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
WSC
2007
13 years 11 months ago
American option pricing under stochastic volatility: a simulation-based approach
We consider the problem of pricing American options when the volatility of the underlying asset price is stochastic. No specific stochastic volatility model is assumed for the st...
Arunachalam Chockalingam, Kumar Muthuraman
ESOP
1999
Springer
14 years 1 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
ICASSP
2011
IEEE
13 years 15 days ago
Automatic target classification in SAR images using MPCA
Multilinear analysis provides a powerful mathematical framework for analyzing synthetic aperture radar (SAR) images resulting from the interaction of multiple factors like sky lum...
Tristan Porges, Gérard Favier
CP
2005
Springer
14 years 2 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 2 months ago
Self-adaptive simulated binary crossover for real-parameter optimization
Simulated binary crossover (SBX) is a real-parameter recombination operator which is commonly used in the evolutionary algorithm (EA) literature. The operator involves a parameter...
Kalyanmoy Deb, Karthik Sindhya, Tatsuya Okabe