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 | ||
| ||
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 | ||
| ||
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-9910813827803321 |
|
Peng Jiming
|
||
| Princeton, NJ : , : Princeton University Press, , [2009] | ||
| 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 [[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-9910812920303321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||