Add to ORKGSometimes, a function f of n variables can be represented as a com-position of two functions of fewer variables. In this case, the problem of computing the range of f on given intervals can be reduced to two range-computation problems with fewer variables. In this paper, we describe a feasible algorithm that checks whether such a reduction is possible – and, if it is possible, produces the desired reduction
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
AbstractThe method for determining the range over which a state probability may change without affec...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
One of the main problems of interval computations is computing the range of a given function over gi...
How to compare different range estimators for multivariate functions under uncertainty? To answer th...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
In many practical situations, we need to find the range of a given function under interval uncertain...
In many practical situations, we need to combine probabilistic and interval uncertainty. For example...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Asaithambi, Zuhe, and Moore (Computing 28, 225-237, 1982) presented an algorithm to find good upper ...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range constraint based on aflow algorithm. We propose an extension of the Range constraint where we ...
This paper analyzes the effectiveness of various monotonic discretizations of an ODE in a parameter ...
It is known that, in general, the problem of computing the range of a given polynomial on given inte...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
AbstractThe method for determining the range over which a state probability may change without affec...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
One of the main problems of interval computations is computing the range of a given function over gi...
How to compare different range estimators for multivariate functions under uncertainty? To answer th...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
In many practical situations, we need to find the range of a given function under interval uncertain...
In many practical situations, we need to combine probabilistic and interval uncertainty. For example...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Asaithambi, Zuhe, and Moore (Computing 28, 225-237, 1982) presented an algorithm to find good upper ...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range constraint based on aflow algorithm. We propose an extension of the Range constraint where we ...
This paper analyzes the effectiveness of various monotonic discretizations of an ODE in a parameter ...
It is known that, in general, the problem of computing the range of a given polynomial on given inte...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
AbstractThe method for determining the range over which a state probability may change without affec...