Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
34,113
Quadrature-based methods for obtaining approximate solutions to nonlinear asset pricing models
- ECONOMETRICA
, 1991
"... ..."
The Approximate Solutions of Blasius Equation
"... We find Blasius function to satisfy the boundary condition f ′ ( ∞) = 1 and obtain the approximate solutions of Blasius equation. ..."
Abstract
- Add to MetaCart
We find Blasius function to satisfy the boundary condition f ′ ( ∞) = 1 and obtain the approximate solutions of Blasius equation.
Finite state Markov-chain approximations to univariate and vector autoregressions
- Economics Letters
, 1986
"... The paper develops a procedure for finding a discrete-valued Markov chain whose sample paths approximate well those of a vector autoregression. The procedure has applications in those areas of economics, finance, and econometrics where approximate solutions to integral equations are required. 1. ..."
Abstract
-
Cited by 493 (0 self)
- Add to MetaCart
The paper develops a procedure for finding a discrete-valued Markov chain whose sample paths approximate well those of a vector autoregression. The procedure has applications in those areas of economics, finance, and econometrics where approximate solutions to integral equations are required. 1.
On approximative solutions of multistopping problems
"... We consider multistopping problems for discrete time sequences as well as for continuous time Poisson processes which serve as limiting models for the discrete time problem. The choice of m-stopping times is allowed and the aim is to maximize the expected value of the best of the m stops. The optima ..."
Abstract
- Add to MetaCart
. The optimal m-stopping curves of the Poisson process are determined by differential equations of first order and allow the construction of approximative solutions of the discrete time m-stopping problem.
Approximate Solution of the Representability Problem
, 1999
"... ABSTRACT: Approximate solution of the ensemble representability problem for density operators of arbitrary order is obtained. This solution is closely related to the “Q condition ” of A. J. Coleman. The representability conditions are formulated in orbital representation and are easy for computer im ..."
Abstract
- Add to MetaCart
ABSTRACT: Approximate solution of the ensemble representability problem for density operators of arbitrary order is obtained. This solution is closely related to the “Q condition ” of A. J. Coleman. The representability conditions are formulated in orbital representation and are easy for computer
Approximate Solutions to Markov Decision Processes
, 1999
"... One of the basic problems of machine learning is deciding how to act in an uncertain world. For example, if I want my robot to bring me a cup of coffee, it must be able to compute the correct sequence of electrical impulses to send to its motors to navigate from the coffee pot to my office. In fact, ..."
Abstract
-
Cited by 78 (10 self)
- Add to MetaCart
like the above one quickly and reliably. Unfortunately, the world is often so complicated that it is difficult or impossible to find the optimal sequence of actions to achieve a given goal. So, in order to scale our learners up to real-world problems, we usually must settle for approximate solutions
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
- J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract
-
Cited by 1010 (2 self)
- Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
- Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract
-
Cited by 1211 (13 self)
- Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
On Continuous Approximate Solution Of Ordinary Differential
"... In this work the problem of continuous approximate solution of the ordinary differential equations will be investigated. An approach to construct the continuous approximate solution, which is based on the discrete approximate solution and the spline interpolation, will be provided. The existence and ..."
Abstract
- Add to MetaCart
In this work the problem of continuous approximate solution of the ordinary differential equations will be investigated. An approach to construct the continuous approximate solution, which is based on the discrete approximate solution and the spline interpolation, will be provided. The existence
Approximating Solution Structure
, 2007
"... Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensively studied by complexity theorists over the last three decades, structural-approximation has not yet been defined, l ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensively studied by complexity theorists over the last three decades, structural-approximation has not yet been defined
Results 1 - 10
of
34,113
