Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon
| Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (297 pages) : illustrations |
| Disciplina |
621.38
621.34* |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Machine theory
Conscious automata |
| Soggetto non controllato |
A Mathematical Theory of Communication
Abstraction (software engineering) Accuracy and precision Algebraic theory Arithmetic Automaton Axiom Binary number Biophysics Bit Boolean algebra (structure) Calculation Chaos theory Circuit design Classical conditioning Combination lock Combination Computable number Computation Concepts (C++) Conditional probability Connectivity (graph theory) Correlation and dependence Counterexample Counting Decision problem Description number Detection Determinism Deterministic system (philosophy) Diagram (category theory) Diagram Entscheidungsproblem Enumeration Equation Estimation Exponentiation Finite-state machine First principle Fixed point (mathematics) Function (mathematics) Gödel numbering Hardware random number generator Heuristic argument Instance (computer science) Interlacing (bitmaps) Intuitionistic logic Lebesgue measure Logarithm Logic Logical disjunction Markov chain Mathematical analysis Mathematical induction Mathematical logic Mathematical notation Mathematical theory Mathematics Measure (mathematics) Metamathematics Modular arithmetic Moment (mathematics) Moore machine Notation Number theory OR gate Parameter (computer programming) Parity (mathematics) Permutation Pilot plant Polynomial Primitive recursive function Probability measure Probability Proportionality (mathematics) Propositional function Quantity Recursion (computer science) Recursive set Recursively enumerable set Result Schematic Sequence Series (mathematics) Set theory Sheffer stroke Sign (mathematics) Solver Special case Stochastic process String (computer science) Subsequence Subset Theorem Thermodynamic equilibrium Trial and error Turing machine Typewriter Universal Turing machine Variable (mathematics) |
| ISBN | 1-4008-8261-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata / Kleene, S. C. -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components / Neumann, J. von -- Some Uneconomical Robots / Culbertson, James T. -- Some Universal Elements for Finite Automata / Minsky, M. L. -- Gedanken-Experiments on Sequential Machines / Moore, Edward F. -- Turing Machines -- A Universal Turing Machine with Two Internal States / Shannon, Claude E. -- A Note on Universal Turing Machines / Davis, M. D. -- The Inversion of Functions Defined by Turing Machines / McCarthy, John -- Computability by Probabilistic Machines / Leeuw, K. de / Moore, E. F. / Shannon, C. E. / Shapiro, N. -- Synthesis of Automata -- Design for an Intelligence-Amplifier / Ashby, W. Ross -- The Epistemological Problem for Automata / MacKay, D. M. -- Conditional Probability Machines and Conditioned Reflexes / Uttley, Albert M. -- Temporal and Spatial Patterns in a Conditional Probability Machine / Uttley, Albert M. |
| Record Nr. | UNINA-9910154745703321 |
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Contributions to the Theory of Games (AM-28), Volume II / / Albert William Tucker, Harold William Kuhn
| Contributions to the Theory of Games (AM-28), Volume II / / Albert William Tucker, Harold William Kuhn |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (409 pages) : illustrations |
| Disciplina | 519.3 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico | Game theory |
| Soggetto non controllato |
A priori probability
Accuracy and precision Addition Assignment problem Basic solution (linear programming) Big O notation Bilinear form Binary game Boolean algebra (structure) Brouwer fixed-point theorem Calculation Cartesian product Cauchy sequence Characteristic function (probability theory) Coefficient Combination Commutative property Computation Conditional probability distribution Continuous function Continuous game Convex set Cooperative game Counterexample Determinacy Diagram (category theory) Dimension (vector space) Disjoint union Duality (mathematics) Eigenfunction Equilibrium point Equivalence class Euclidean space Existence theorem Existential quantification Expected value Function (mathematics) Hyperplane Idealization Imputation (statistics) Inequality (mathematics) Infimum and supremum Integral equation Intersection (set theory) Interval (mathematics) Kakutani fixed-point theorem Limit of a sequence Limit point Linear differential equation Linear inequality Matching Pennies Mathematical induction Mathematical optimization Mathematics Matrix (mathematics) Measure (mathematics) Minimax theorem Monotonic function Mutual exclusivity Neumann series Numerical analysis Open problem Open set Outcome (probability) Partial derivative Partially ordered set Permutation matrix Permutation Polynomial Positional notation Preference (economics) Probability distribution Probability measure Probability Property B. Proportionality (mathematics) Quantity Ranking (information retrieval) Ring of sets Saddle point Scientific notation Sign (mathematics) Solution set Special case Statistical hypothesis testing Step function Strategy (game theory) Subset Summation Symmetrization Theorem Theory of Games and Economic Behavior Theory Three-dimensional space (mathematics) Topology Transcendental number Transformation matrix Unit interval Units of measurement Variable (mathematics) |
| ISBN | 1-4008-8197-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface / Kuhn, H. W. / Tucker, A. W. -- Contents -- Part I. Finite Zero-Sum Two-Persons Games -- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem / Neumann, John von -- 2. Two Variants of Poker / Gillies, D. B. / Mayberry, J. P. / Neumann, J. von -- 3. The Double Description Method / Motzkin, T. S. / Raiffa, H. / Thompson, G. L. / Thrall, R. M. -- 4. Solutions of Convex Games as Fixed-points / Dresher, M. / Karlin, S. -- 5. Admissible Points of Convex Sets / Arrow, K. J. / Barankin, E. W. / Blackwell, D. -- Part II. Infinite Zero-Sum Two-Persons Games -- 6. Games of Timing / Shiffman, Max -- 7. Reduction of Certain Classes of Games to Integral Equations / Karlin, Samuel -- 8. On a Class of Games / Karlin, Samuel -- 9. Notes on Games over the Square / Glicksberg, I. / Gross, O. -- 10. On Randomization in Statistical Games with k Terminal Actions / Blackwell, David -- Part III. Games in Extensive Form -- 11. Extensive Games and the Problem of Information / Kuhn, H. W. -- 12. Equivalence of Information Patterns and Essentially Determinate Games / Dalkey, Norman -- 13. Infinite Games with Perfect Information / Gale, David / Stewart, F. M. -- 14. Signaling Strategies in n-Person Games / Thompson, G. L. -- 15. Bridge and Signaling / Thompson, G. L. -- 16. Sums of Positional Games / Milnor, John -- Part IV. General n-Person Games -- 17. A Value for n-Person Games / Shapley, L. S. -- 18. Symmetric Solutions to Majority Games / Bott, Raoul -- 19. Discriminatory and Bargaining Solutions to a Class of Symmetric n-Person Games / Gillies, D. B. -- 20. Quota Solutions of n-Person Games / Shapley, L. S. -- 21. Arbitration Schemes for Generalized Two-person Games / Raiffa, Howard -- Bibliography -- Backmatter |
| Record Nr. | UNINA-9910154750503321 |
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Control theoretic splines [[electronic resource] ] : optimal control, statistics, and path planning / / Magnus Egerstedt and Clyde Martin
| Control theoretic splines [[electronic resource] ] : optimal control, statistics, and path planning / / Magnus Egerstedt and Clyde Martin |
| Autore | Egerstedt Magnus |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2010 |
| Descrizione fisica | 1 online resource (227 p.) |
| Disciplina | 511/.42 |
| Altri autori (Persone) | MartinClyde |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Interpolation
Smoothing (Numerical analysis) Smoothing (Statistics) Curve fitting Splines Spline theory |
| Soggetto non controllato |
Accuracy and precision
Affine space Affine variety Algorithm Approximation Arbitrarily large B-spline Banach space Bernstein polynomial Bifurcation theory Big O notation Birkhoff interpolation Boundary value problem Bézier curve Chaos theory Computation Computational problem Condition number Constrained optimization Continuous function (set theory) Continuous function Control function (econometrics) Control theory Controllability Convex optimization Convolution Cubic Hermite spline Data set Derivative Differentiable function Differential equation Dimension (vector space) Directional derivative Discrete mathematics Dynamic programming Equation Estimation Filtering problem (stochastic processes) Gaussian quadrature Gradient descent Gramian matrix Growth curve (statistics) Hermite interpolation Hermite polynomials Hilbert projection theorem Hilbert space Initial condition Initial value problem Integral equation Iterative method Karush–Kuhn–Tucker conditions Kernel method Lagrange polynomial Law of large numbers Least squares Linear algebra Linear combination Linear filter Linear map Mathematical optimization Mathematics Maxima and minima Monotonic function Nonlinear programming Nonlinear system Normal distribution Numerical analysis Numerical stability Optimal control Optimization problem Ordinary differential equation Orthogonal polynomials Parameter Piecewise Pointwise Polynomial interpolation Polynomial Probability distribution Quadratic programming Random variable Rate of convergence Ratio test Riccati equation Simpson's rule Simultaneous equations Smoothing spline Smoothing Smoothness Special case Spline (mathematics) Spline interpolation Statistic Stochastic calculus Stochastic Telemetry Theorem Trapezoidal rule Waypoint Weight function Without loss of generality |
| ISBN |
1-282-45796-9
1-282-93606-9 9786612936067 9786612457968 1-4008-3387-6 |
| Classificazione | SK 880 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
| Record Nr. | UNINA-9910780863803321 |
Egerstedt Magnus
|
||
| Princeton, : Princeton University Press, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Finite Dimensional Vector Spaces. (AM-7), Volume 7 / / Paul R. Halmos
| Finite Dimensional Vector Spaces. (AM-7), Volume 7 / / Paul R. Halmos |
| Autore | Halmos Paul R (Paul Richard), <1916-2006, > |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (206 pages) |
| Disciplina | 512.52 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Transformations (Mathematics)
Generalized spaces |
| Soggetto non controllato |
Absolute value
Accuracy and precision Addition Affine space Algebraic closure Algebraic equation Algebraic operation Algebraically closed field Associative property Automorphism Axiom Banach space Basis (linear algebra) Bilinear form Bounded operator Cardinal number Cayley transform Characteristic equation Characterization (mathematics) Coefficient Commutative property Complex number Complex plane Computation Congruence relation Convex set Coordinate system Determinant Diagonal matrix Dimension (vector space) Dimension Dimensional analysis Direct product Direct proof Direct sum Division by zero Dot product Dual basis Eigenvalues and eigenvectors Elementary proof Equation Euclidean space Existential quantification Function of a real variable Functional calculus Fundamental theorem Geometry Gram–Schmidt process Hermitian matrix Hilbert space Infimum and supremum Jordan normal form Lebesgue integration Linear combination Linear function Linear independence Linear map Linear programming Linearity Manifold Mathematical induction Mathematics Minimal polynomial (field theory) Minor (linear algebra) Monomial Multiplication sign Natural number Nilpotent Normal matrix Normal operator Number theory Orthogonal basis Orthogonal complement Orthogonal coordinates Orthogonality Orthonormality Polynomial Quotient space (linear algebra) Quotient space (topology) Real number Real variable Scalar (physics) Scientific notation Series (mathematics) Set (mathematics) Sign (mathematics) Special case Spectral theorem Spectral theory Summation Tensor calculus Theorem Topology Transitive relation Unbounded operator Uncountable set Unit sphere Unitary transformation Variable (mathematics) Vector space |
| ISBN | 1-4008-8223-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | PREFACE -- TABLE OP CONTENTS -- ERRATA -- Chapter I. SPACES -- Chapter II. TRANSFORMATIONS -- Chapter III. ORTHOGONALITY -- APPENDIX I. THE CLASSICAL CANONICAL FORM -- APPENDIX II. DIRECT PRODUCTS -- APPENDIX III. HILBERT SPACE -- BIBLIOGRAPHY -- LIST OF NOTATIONS -- INDEX OF DEFINITIONS |
| Record Nr. | UNINA-9910154744503321 |
|
Halmos Paul R (Paul Richard), <1916-2006, >
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
On the cohomology of certain noncompact Shimura varieties [[electronic resource] /] / Sophie Morel; with an appendix by Robert Kottwitz
| On the cohomology of certain noncompact Shimura varieties [[electronic resource] /] / Sophie Morel; with an appendix by Robert Kottwitz |
| Autore | Morel Sophie <1979-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2010 |
| Descrizione fisica | 1 online resource (231 p.) |
| Disciplina | 516.3/52 |
| Collana | Annals of mathematics |
| Soggetto topico |
Shimura varieties
Homology theory |
| Soggetto non controllato |
Accuracy and precision
Adjoint Algebraic closure Archimedean property Automorphism Base change map Base change Calculation Clay Mathematics Institute Coefficient Compact element Compact space Comparison theorem Conjecture Connected space Connectedness Constant term Corollary Duality (mathematics) Existential quantification Exterior algebra Finite field Finite set Fundamental lemma (Langlands program) Galois group General linear group Haar measure Hecke algebra Homomorphism L-function Logarithm Mathematical induction Mathematician Maximal compact subgroup Maximal ideal Morphism Neighbourhood (mathematics) Open set Parabolic induction Permutation Prime number Ramanujan–Petersson conjecture Reductive group Ring (mathematics) Scientific notation Shimura variety Simply connected space Special case Sub"ient Subalgebra Subgroup Symplectic group Theorem Trace formula Unitary group Weyl group |
| ISBN |
1-282-45800-0
1-282-93632-8 9786612936326 9786612458002 1-4008-3539-9 |
| Classificazione | SI 830 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1. The fixed point formula -- Chapter 2. The groups -- Chapter 3. Discrete series -- Chapter 4. Orbital integrals at p -- Chapter 5. The geometric side of the stable trace formula -- Chapter 6. Stabilization of the fixed point formula -- Chapter 7. Applications -- Chapter 8. The twisted trace formula -- Chapter 9. The twisted fundamental lemma -- Appendix. Comparison of two versions of twisted transfer factors -- Bibliography -- Index |
| Record Nr. | UNINA-9910780861803321 |
|
Morel Sophie <1979->
|
||
| Princeton, : Princeton University Press, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski
| Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski |
| Autore | Ben-Tal A |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, c2009 |
| Descrizione fisica | 1 online resource (565 p.) |
| Disciplina | 519.6 |
| Altri autori (Persone) |
El GhaouiLaurent
NemirovskiĭArkadiĭ Semenovich |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Robust optimization
Linear programming |
| Soggetto non controllato |
0O
Accuracy and precision Additive model Almost surely Approximation algorithm Approximation Best, worst and average case Bifurcation theory Big O notation Candidate solution Central limit theorem Chaos theory Coefficient Computational complexity theory Constrained optimization Convex hull Convex optimization Convex set Cumulative distribution function Curse of dimensionality Decision problem Decision rule Degeneracy (mathematics) Diagram (category theory) Duality (optimization) Dynamic programming Exponential function Feasible region Floor and ceiling functions For All Practical Purposes Free product Ideal solution Identity matrix Inequality (mathematics) Infimum and supremum Integer programming Law of large numbers Likelihood-ratio test Linear dynamical system Linear inequality Linear map Linear matrix inequality Linear programming Linear regression Loss function Margin classifier Markov chain Markov decision process Mathematical optimization Max-plus algebra Maxima and minima Multivariate normal distribution NP-hardness Norm (mathematics) Normal distribution Optimal control Optimization problem Orientability P versus NP problem Pairwise Parameter Parametric family Probability distribution Probability Proportionality (mathematics) Quantity Random variable Relative interior Robust control Robust decision-making Robust optimization Semi-infinite Sensitivity analysis Simple set Singular value Skew-symmetric matrix Slack variable Special case Spherical model Spline (mathematics) State variable Stochastic calculus Stochastic control Stochastic optimization Stochastic programming Stochastic Strong duality Support vector machine Theorem Time complexity Uncertainty Uniform distribution (discrete) Unimodality Upper and lower bounds Variable (mathematics) Virtual displacement Weak duality Wiener filter With high probability Without loss of generality |
| ISBN |
1-282-25928-8
9786612259289 1-4008-3105-9 |
| Classificazione | SK 870 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Part I. Robust Linear Optimization -- Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- Part II. Robust Conic Optimization -- Chapter Five. Uncertain Conic Optimization: The Concepts -- Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- Chapter Twelve. Robust Classi¯cation and Estimation -- Part III. Robust Multi-Stage Optimization -- Chapter Thirteen. Robust Markov Decision Processes -- Chapter Fourteen. Robust Adjustable Multistage Optimization -- Part IV. Selected Applications -- Chapter Fifteen. Selected Applications -- Appendix A: Notation and Prerequisites -- Appendix B: Some Auxiliary Proofs -- Appendix C: Solutions to Selected Exercises -- Bibliography -- Index |
| Record Nr. | UNINA-9910778219003321 |
|
Ben-Tal A
|
||
| Princeton, NJ, : Princeton University Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky
| Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky |
| Autore | Peng Jiming |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2009] |
| Descrizione fisica | 1 online resource (201 p.) |
| Disciplina | 519.6 |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Interior-point methods
Mathematical optimization Programming (Mathematics) Civil & Environmental Engineering Engineering & Applied Sciences Operations Research |
| Soggetto non controllato |
Accuracy and precision
Algorithm Analysis of algorithms Analytic function Associative property Barrier function Binary number Block matrix Combination Combinatorial optimization Combinatorics Complexity Conic optimization Continuous optimization Control theory Convex optimization Delft University of Technology Derivative Differentiable function Directional derivative Division by zero Dual space Duality (mathematics) Duality gap Eigenvalues and eigenvectors Embedding Equation Estimation Existential quantification Explanation Feasible region Filter design Function (mathematics) Implementation Instance (computer science) Invertible matrix Iteration Jacobian matrix and determinant Jordan algebra Karmarkar's algorithm Karush–Kuhn–Tucker conditions Line search Linear complementarity problem Linear function Linear programming Lipschitz continuity Local convergence Loss function Mathematical optimization Mathematician Mathematics Matrix function McMaster University Monograph Multiplication operator Newton's method Nonlinear programming Nonlinear system Notation Operations research Optimal control Optimization problem Parameter (computer programming) Parameter Pattern recognition Polyhedron Polynomial Positive semidefinite Positive-definite matrix Quadratic function Requirement Result Scientific notation Second derivative Self-concordant function Sensitivity analysis Sign (mathematics) Signal processing Simplex algorithm Simultaneous equations Singular value Smoothness Solution set Solver Special case Subset Suggestion Technical report Theorem Theory Time complexity Two-dimensional space Upper and lower bounds Variable (computer science) Variable (mathematics) Variational inequality Variational principle Without loss of generality Worst-case complexity Yurii Nesterov |
| ISBN |
1-282-08760-6
9786612087608 1-4008-2513-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Acknowledgments -- Notation -- List of Abbreviations -- Chapter 1. Introduction and Preliminaries -- Chapter 2. Self-Regular Functions and Their Properties -- Chapter 3. Primal-Dual Algorithms for Linear Optimization Based on Self-Regular Proximities -- Chapter 4. Interior-Point Methods for Complementarity Problems Based on Self- Regular Proximities -- Chapter 5. Primal-Dual Interior-Point Methods for Semidefinite Optimization Based on Self-Regular Proximities -- Chapter 6. Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities -- Chapter 7. Initialization: Embedding Models for Linear Optimization, Complementarity Problems, Semidefinite Optimization and Second-Order Conic Optimization -- Chapter 8. Conclusions -- References -- Index |
| Record Nr. | UNINA-9910777727403321 |
|
Peng Jiming
|
||
| Princeton, NJ : , : Princeton University Press, , [2009] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stable and Random Motions in Dynamical Systems : With Special Emphasis on Celestial Mechanics (AM-77) / / Jurgen Moser
| Stable and Random Motions in Dynamical Systems : With Special Emphasis on Celestial Mechanics (AM-77) / / Jurgen Moser |
| Autore | Moser Jurgen |
| Edizione | [With a New foreword by Philip J. Holmes] |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (212 pages) : illustrations |
| Disciplina | 521/.1 |
| Collana | Princeton Landmarks in Mathematics and Physics |
| Soggetto topico | Celestial mechanics |
| Soggetto non controllato |
Accuracy and precision
Action-angle coordinates Analytic function Bounded variation Calculation Chaos theory Coefficient Commutator Constant term Continuous embedding Continuous function Coordinate system Countable set Degrees of freedom (statistics) Degrees of freedom Derivative Determinant Differentiable function Differential equation Dimension (vector space) Discrete group Divergent series Divisor Duffing equation Eigenfunction Eigenvalues and eigenvectors Elliptic orbit Energy level Equation Ergodic theory Ergodicity Euclidean space Even and odd functions Existence theorem Existential quantification First-order partial differential equation Forcing function (differential equations) Fréchet derivative Gravitational constant Hamiltonian mechanics Hamiltonian system Hessian matrix Heteroclinic orbit Homoclinic orbit Hyperbolic partial differential equation Hyperbolic set Initial value problem Integer Integrable system Integration by parts Invariant manifold Inverse function Invertible matrix Iteration Jordan curve theorem Klein bottle Lie algebra Linear map Linear subspace Linearization Maxima and minima Monotonic function Newton's method Nonlinear system Normal bundle Normal mode Open set Parameter Partial differential equation Periodic function Periodic point Perturbation theory (quantum mechanics) Phase space Poincaré conjecture Polynomial Probability theory Proportionality (mathematics) Quasiperiodic motion Rate of convergence Rational dependence Regular element Root of unity Series expansion Sign (mathematics) Smoothness Special case Stability theory Statistical mechanics Structural stability Symbolic dynamics Symmetric matrix Tangent space Theorem Three-body problem Uniqueness theorem Unitary matrix Variable (mathematics) Variational principle Vector field Zero of a function |
| ISBN | 1-4008-8269-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- TABLE OF CONTENTS -- I. INTRODUCTION -- II. STABILITY PROBLEMS -- III. STATISTICAL BEHAVIOR -- V. FINAL REMARKS -- V. EXISTENCE PROOF IN THE PRESENCE OF SMALL DIVISORS -- VI. PROOFS AND DETAILS FOR CHAPTER III -- BOOKS AND SURVEY ARTICLES |
| Record Nr. | UNINA-9910164944903321 |
|
Moser Jurgen
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910812920303321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||