The following pages link to Reliable Computing (Q163536):
Displaying 50 items.
- Fast multiplication of interval matrices (Interval version of Strassen's algorithm) (Q1826443) (← links)
- Clouds, fuzzy sets, and probability intervals (Q1826444) (← links)
- Probability-possibility transformations, triangular fuzzy sets, and probabilistic inequalities (Q1826445) (← links)
- Characterization of interval fuzzy logic systems of connectives by group transformations (Q1826446) (← links)
- Modeling uncertain sparse data with fuzzy B-splines (Q1826513) (← links)
- Fuzzy linear programming with interactive uncertain parameters (Q1826514) (← links)
- Application of functional intervals to the response evaluation of linear time-invariant systems with fuzzy input (Q1826515) (← links)
- Solutions for the portfolio selection problem with interval and fuzzy coefficients (Q1826517) (← links)
- Eliminating duplicates under interval and fuzzy uncertainty: an asymptotically optimal algorithm and its geospatial applications (Q1826518) (← links)
- A new technique in systems analysis under interval uncertainty and ambiguity (Q1869600) (← links)
- A QFT procedure for generating design frequencies and bounds of guaranteed accuracy (Q1869601) (← links)
- Symbolic preconditioning with Taylor models: Some examples (Q1869602) (← links)
- Kernel-splitting technique for enclosing the solution of Fredholm equations of the first kind (Q1869603) (← links)
- Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) (Q1869604) (← links)
- Outer solution of linear systems whose elements are affine functions of interval parameters (Q1869605) (← links)
- Diagrammatic analysis of interval linear equations. I: Basic notions and the one-dimensional case (Q1869606) (← links)
- Controlling the wrapping effect in the solution of ODEs for asteroids (Q1869607) (← links)
- Taylor forms -- use and limits. (Q1869608) (← links)
- Formulas for the width of interval products (Q1899451) (← links)
- Inner estimation of the united solution set of interval linear algebraic system (Q1899453) (← links)
- Why intervals? A simple limit theorem that is similar to limit theorems from statistics (Q1899454) (← links)
- A combined method for enclosing all solutions of nonlinear systems of polynomial equations (Q1899456) (← links)
- An informal introduction to a high level language with applications to interval mathematics (Q1899457) (← links)
- A parallel interval method implementation for global optimization using dynamic load balancing (Q1899458) (← links)
- Parallel algorithms for interval computations. In part papers presented at a special session on languages for parallel scientific computation at the CSAM '93 conference in St. Petersburg, Russia (Q1899459) (← links)
- Parallel interval-based reasoning in medical knowledge-based system CLINAID (Q1899460) (← links)
- Applications of interval computations to earthquake-resistant engineering: How to compute derivatives of interval functions fast (Q1899463) (← links)
- A reliable linear algebra library for transputer networks (Q1899466) (← links)
- Parallel accurate linear algebra subroutines (Q1899467) (← links)
- Application of interval Newton's method to chemical engineering problems (Q1904303) (← links)
- Ockham's razor in interval identification (Q1904305) (← links)
- An automatic and guaranteed determination of the number of roots of an analytic function interior to a simple closed curve in the complex plane (Q1904306) (← links)
- A general iterative sparse linear solver and its parallelization for interval Newton methods (Q1904308) (← links)
- Optimizing INTBIS on the CRAY Y-MP (Q1904310) (← links)
- Study on sampling techniques with CMMs (Q1904313) (← links)
- A new characterization of the set of all intervals, based on the necessity to check consistency easily (Q1904314) (← links)
- Interpolation that leads to the narrowest intervals and its application to expert systems and intelligent control (Q1904317) (← links)
- A parallel complex zero finder (Q1904319) (← links)
- A software interface and hardware design for variable-precision interval arithmetic (Q1904320) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- Proceedings of the international conference on interval and computer- algebraic methods in science and engineering, Interval '94, St. Petersburg, Russia, March 7-10, 1994. Selected papers (Q1904348) (← links)
- Matrix computation of subresultant polynomial remainder sequences in integral domains (Q1904349) (← links)
- Numerical methods using defects (Q1904350) (← links)
- An estimate of the absolute value and width of the solution of a linear system of equations with tridiagonal interval matrix by the interval sweep method (Q1904352) (← links)
- Verification methods for inclusion disks (Q1904354) (← links)
- Design of a parallel linear algebra library for verified computation (Q1904355) (← links)
- Computation of the stability radius of a Schur polynomial: An orthogonal projection approach (Q1904356) (← links)
- Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic (Q1916971) (← links)
- Bounds of high quality for first kind Volterra integral equations (Q1916972) (← links)
- Variable-precision, interval arithmetic coprocessors (Q1916973) (← links)
