Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage
American Psychological Association 6th edition

Anthony Leclerc. (2001). Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution INTERVAL ANALYSIS: PARALLEL METHODS FOR GLOBAL OPTIMIZATION. Springer US, 2001. https://doi.org/10.1007/0-306-48332-7_225

ISO-690 (author-date, English)

ANTHONY LECLERC, 2001. Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution INTERVAL ANALYSIS: PARALLEL METHODS FOR GLOBAL OPTIMIZATION. Springer US, 2001.

Modern Language Association 9th edition

Anthony Leclerc. Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution INTERVAL ANALYSIS: PARALLEL METHODS FOR GLOBAL OPTIMIZATION. Springer US, 2001., 2001, https://doi.org/10.1007/0-306-48332-7_225.

Mohr Siebeck - Recht (Deutsch - Österreich)

Anthony Leclerc: Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution INTERVAL ANALYSIS: PARALLEL METHODS FOR GLOBAL OPTIMIZATION, 2001.

Emerald - Harvard

Anthony Leclerc. (2001), Asynchronous distributed optimization algorithms; Automatic differentiation: Parallel computation; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Heuristic search; Interval analysis: Application to chemical engineering design problems; Interval analysis: Differential equations; Interval analysis: Eigenvalue bounds of interval matrices; Interval analysis: Intermediate terms; Interval analysis: Nondifferentiable problems; Interval analysis: Subdivision directions in interval branch and bound methods; Interval analysis: Systems of nonlinear equations; Interval analysis: Unconstrained and constrained optimization; Interval analysis: Verifying feasibility; Interval constraints; Interval fixed point theory; Interval global optimization; Interval linear systems; Interval Newton methods; Load balancing for parallel optimization techniques; Parallel computing: Complexity classes; Parallel computing: Models; Parallel heuristic search; Stochastic network problems: Massively parallel solution INTERVAL ANALYSIS: PARALLEL METHODS FOR GLOBAL OPTIMIZATION, Bd. , Springer US, 2001., verfügbar unter:https://doi.org/10.1007/0-306-48332-7_225.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.