Sciweavers

254 search results - page 2 / 51
» On the randomized solution of initial value problems
Sort
View
MOC
2002
98views more  MOC 2002»
13 years 6 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
ECAI
2010
Springer
13 years 7 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
SIAMJO
2008
57views more  SIAMJO 2008»
13 years 6 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
ICONIP
1998
13 years 7 months ago
A Study on Initialization for BP Networks
This paper proposes an initialization of back propagation (BP) networks for pattern classification problems; the weights of hidden units are initialized so that hyperplanes should...
Hiroshi Shiratsuchi, Hiromu Gotanda, Katsuhiro Ino...
AMC
2007
93views more  AMC 2007»
13 years 6 months ago
Moving averages of solutions of ODEs
Moving averages of the solution of an initial value problem for a system of ordinary differential equations are used to extract the general behavior of the solution without follow...
Lawrence F. Shampine, Skip Thompson