Add to ORKGSometimes, a function f of n variables can be represented as a composition 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
AbstractThe method for determining the range over which a state probability may change without affec...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
It is known that, in general, the problem of computing the range of a given polynomial on given inte...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In many practical situations, we need to find the range of a given function under interval uncertain...
One of the main problems of interval computations is computing the range of a given function over gi...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
How to compare different range estimators for multivariate functions under uncertainty? To answer th...
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 ...
Range constraint based on aflow algorithm. We propose an extension of the Range constraint where we ...
One of the main problems of interval computations is to compute the range Y of the given function f(...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
AbstractThe method for determining the range over which a state probability may change without affec...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
It is known that, in general, the problem of computing the range of a given polynomial on given inte...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In many practical situations, we need to find the range of a given function under interval uncertain...
One of the main problems of interval computations is computing the range of a given function over gi...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
How to compare different range estimators for multivariate functions under uncertainty? To answer th...
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 ...
Range constraint based on aflow algorithm. We propose an extension of the Range constraint where we ...
One of the main problems of interval computations is to compute the range Y of the given function f(...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
AbstractThe method for determining the range over which a state probability may change without affec...
In many practical problems, we need to estimate the range of a given expression f(x1, ..., xn) when ...
It is known that, in general, the problem of computing the range of a given polynomial on given inte...