Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarReliable Computing, Volume 3
Volume 3, Number 1, February 1997
- Michael A. Wolfe:
An Interval Algorithm for Bounding the Ranges of Real-Valued Functions of One Real Variable. 31-50 - Anatoly V. Lakeyev, Vladik Kreinovich:
NP-Hard Classes of Linear Algebraic Systems with Uncertainties. 51-81 - Hung T. Nguyen, Vladik Kreinovich:
From Numerical Intervals to Set Intervals (Interval-Related Results Presented at the First International Workshop on Applications and Theory of Random Sets). 95-102
Volume 3, Number 2, May 1997
- Teruya Minamoto, Mitsuhiro T. Nakao:
Numerical Verifications of Solutions for Nonlinear Parabolic Equations in One-Space Dimensional Case. 137-147 - Leticia S. Chee:
Computing the Value of a Boolean Expression with Interval Inputs is NP-Hard. 155-172
Volume 3, Number 3, August 1997
- Zenon Kulpa:
Diagrammatic Representation of Interval Space in Proving Theorems about Interval Relations. 209-217 - Jürgen K. Weinhofer, Werner C. Haas:
H[infin]-Control Using Polynomial Matrices and Interval Arithmetic. 229-237 - Werner Hofschuster, Walter Krämer:
A Computer Oriented Approach to Get Sharp Reliable Error Bounds. 239-248 - Wolfram Luther, Werner Otten:
Approximation Error and Error Accumulation for the Landen Transform. 249-258 - Marian Mrozek, Marcin Zelawski:
Heteroclinic Connections in the Kuramoto-Sivashinsky Equation: a Computer Assisted Proof. 277-285 - Hans-Jürgen Dobner, Stefan Ritter:
Attacking a Conjecture in Mathematical Physics by Combining Methods of Computational Analysis and Scientific Computing. 287-295 - Benedito Melo Acióly, Benjamín René Callejas Bedregal:
A Quasi-Metric Topology Compatible with Inclusion Monotonicity on Interval Space. 305-313 - Frédéric Benhamou, Laurent Granvilliers:
Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. 335-344
Volume 3, Number 4, November 1997
- Ljiljana D. Petkovic, Slobodan Trickovic, Miodrag S. Petkovic:
Slope Methods of Higher Order for the Inclusion of Complex Roots of Polynomials. 349-362 - Ferenc Kálovics, Gabriella Mészáros:
Finding Global Minima of Maximum Functions by Using Exclusion Functions without Derivatives. 381-399 - Yelena M. Smagina:
A New Approach to the Modal Regulator Synthesis for Interval Plant with Scalar Input. 401-410 - Volker Stahl:
Error Reduction of the Taylor Centered Form by Half and an Inner Estimation of the Range. 411-420 - Gerhard Heindl:
How to Compute Interval Inclusions of Geodetic Coordinates from Interval Inclusions of Cartesian Coordinates. 421-435 - Vladik Kreinovich, Scott A. Starks, Günter Mayer:
On a Theoretical Justification of the Choice of Epsilon-Inflation in PASCAL-XSC. 437-445 - Applications to Control. 448-452
- Luc Longpré, Martin Berz:
Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). 453-457 - Helmut Ratschek, Jon G. Rokne:
Reliable Computing Special Issue on Reliable Geometric Computations. 461-462
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-26 15:11 CEST by the dblp team