


default search action
Reliable Computing, Volume 17
Volume 17, December 2012
- Jürgen Garloff, Andrew P. Smith:

Guest editors preface.
- Jorge Delgado, Juan Manuel Peña:

Optimality of Bernstein Representations for Computational Purposes. 1-10 - Richard Leroy:

Convergence under Subdivision and Complexity of Polynomial Minimization in the Simplicial Bernstein Basis. 11-21 - Dominique Michelucci, Sebti Foufou, Arnaud Kubicki:

On the Complexity of the Bernstein Combinatorial Problem. 22-33 - Anthony Narkawicz, Jürgen Garloff, Andrew P. Smith, César A. Muñoz:

Bounding the Range of a Rational Function over a box. 34-39 - Shashwati Ray, P. S. V. Nataraj:

A Matrix Method for Efficient Computation of Bernstein Coefficients. 40-71
- Szilvia Béla, Bert Jüttler:

Real Root Approximation Using Fat Spheres. 72-96 - Luis G. Crespo, Daniel P. Giesy, Sean P. Kenny:

A Unifying Framework to Uncertainty Quantification of Polynomial Systems Subject to Aleatory and Epistemic Uncertainty. 97-127 - Thao Dang, Romain Testylier:

Reachability Analysis for Polynomial Dynamical Systems Using the Bernstein Expansion. 128-152 - Coen C. de Visser, Erik-Jan van Kampen, Qiping Chu, J. A. Mulder:

Intersplines: A New Approach to Globally Optimal Multivariate Splines Using Interval Analysis. 153-191 - Sebti Foufou, Dominique Michelucci:

The Bernstein Basis and its Applications in Solving Geometric Constraint Systems. 192-208 - Anthony Narkawicz, César A. Muñoz:

Formal Verification of Conflict Detection Algorithms for Arbitrary Trajectories. 209-237

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














