Sciweavers

530 search results - page 7 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
IJCAI
1989
13 years 8 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
IJCAI
2007
13 years 9 months ago
Forward Search Value Iteration for POMDPs
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly converge to an approximate solution for medium-sized problems...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
CGF
1999
79views more  CGF 1999»
13 years 7 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos
CSCLP
2005
Springer
14 years 1 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
JSCIC
2008
79views more  JSCIC 2008»
13 years 7 months ago
A New Ghost Cell/Level Set Method for Moving Boundary Problems: Application to Tumor Growth
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...
Paul Macklin, John Lowengrub