Results 171 to 180 of about 1,402 (212)
Some of the next articles are maybe not open access.
Robust visualization of strange attractors using affine arithmetic
Computers and Graphics, 2006Luiz Henrique de Figueiredo +2 more
exaly +2 more sources
Robust symbolic regression with affine arithmetic
Proceedings of the 12th annual conference on Genetic and evolutionary computation, 2010We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze expressions generated by the genetic operators, estimating their output range given the ranges of their inputs over the training data. These estimated output ranges allow us to
Cassio Pennachin +2 more
openaire +1 more source
IDEAL ARITHMETIC IN AFFINE PI RINGS
The Quarterly Journal of Mathematics, 1992A prime, noetherian, hereditary ring \(R\) whose nonzero ideals are invertible is called a Dedekind prime ring. It is well-known that a commutative domain is Dedekind if (and only if) its ideals are products of prime ideals. Due to \textit{A. W. Chatters} and \textit{C. R. Hajarnavis} [J.
Chatters, AW +2 more
openaire +2 more sources
Approximating Implicit Curves on Triangulations with Affine Arithmetic
2012 25th SIBGRAPI Conference on Graphics, Patterns and Images, 2012We present an adaptive method for computing a robust polygonal approximation of an implicit curve in the plane that uses affine arithmetic to identify regions where the curve lies inside a thin strip. Unlike other interval methods, even those based on affine arithmetic, our method works on triangulations, not only on rectangular quad trees.
Afonso Paiva 0001 +3 more
openaire +1 more source
Sampling procedural shaders using affine arithmetic
ACM Transactions on Graphics, 1997Procedural shaders have become popular tools for describing surface reflectance functions and other material properties. In comparison to fixed resolution textures, they have the advantage of being resolution-independent and storage-efficient. While procedural shaders provide an interface for evaluating the shader at a single point, it is not
Wolfgang Heidrich +2 more
openaire +3 more sources
Affine Texture Mapping and Antialiasing Using Integer Arithmetic
Computer Graphics Forum, 1992AbstractTexture mapping techniques are very useful for generating more realistic images. However, texture compression, generally induced by geometric transformations, is at the origin of aliasing artifacts especially the well‐known “moire” patterns. Two discrete affine texture mapping methods based exclusively on integer arithmetic are presented here ...
Philippe Nehlig, Djamchid Ghazanfarpour
openaire +2 more sources
A General Reliable Quadratic Form: An Extension of Affine Arithmetic
Reliable Computing, 2006The paper indicates a new way to generate bounds for the range of polynomial functions \(f\) over a hypercube \(X\subseteq\mathbb{R}^n\). To this end general quadratic forms (GQF) are used which are defined by \[ \widehat{\widehat x}= \varepsilon^T A\varepsilon+ b^T\varepsilon+c + e^+\varepsilon_{n+1}+ e^-\varepsilon_{n+2}+ e\varepsilon_{n+ 3 ...
Frédéric Messine, Ahmed Touhami
openaire +1 more source
On the Arithmetic Difference of Affine Cantor Sets
Journal of Dynamical Systems and Geometric Theories, 2006In this paper we construct a recurrent compact set for the relative configurations set of special affine Cantor sets.
B. Honary, M. Pourbarat, M.R. Velayati
openaire +1 more source
Symbolic Simulation of Parametrized Hybrid Systems with Affine Arithmetic
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME), 2016The purpose of this research is to develop a highly reliable simulator of hybrid systems, i.e., systems involving both discrete change and continuous evolution. In particular, we aim at rigorous simulation of parametrized hybrid systems, which enables not only the analysis of model's possible behavior but also the design of parameters that realize ...
Shota Matsumoto, Kazunori Ueda
openaire +1 more source
Affine Arithmetic and Applications to Real-Number Proving
2015Accuracy and correctness are central issues in numerical analysis. To address these issues, several self-validated computation methods have been proposed in the last fifty years. Their common goal is to provide rigorously correct enclosures for calculated values, sacrificing a measure of precision for correctness.
Mariano M. Moscato +2 more
openaire +1 more source