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 | ||
| ||
Combinatorial Group Theory and Topology. (AM-111), Volume 111 / / John R. Stallings, S. M. Gersten
| Combinatorial Group Theory and Topology. (AM-111), Volume 111 / / John R. Stallings, S. M. Gersten |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (565 pages) : illustrations |
| Disciplina | 512/.22 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Combinatorial group theory
Topology |
| Soggetto non controllato |
Abelian group
Algebraic equation Algebraic integer Automorphism Basis (linear algebra) Betti number Cayley graph Cayley–Hamilton theorem Characteristic polynomial Characteristic subgroup Characterization (mathematics) Classifying space Combinatorial group theory Combinatorics Commutative algebra Commutative property Commutator subgroup Compactification (mathematics) Complement (set theory) Conformal map Conjugacy class Connected component (graph theory) Connectivity (graph theory) Coprime integers Coset Coxeter group Cyclic group Cyclic permutation Degeneracy (mathematics) Dehn's lemma Diagram (category theory) Dirac delta function Disk (mathematics) Epimorphism Equation Euclidean group Finite group Finitely generated abelian group Finitely generated group Free abelian group Free group Freiheitssatz Fuchsian group Function (mathematics) Fundamental domain Fundamental group Fundamental lemma (Langlands program) G-module General linear group Generating set of a group Geodesic Graph (discrete mathematics) Graph of groups Graph product Group theory Haken manifold Harmonic analysis Homological algebra Homology (mathematics) Homomorphism Homotopy Hurwitz's theorem (number theory) Hyperbolic 3-manifold Identity theorem Inclusion map Inequality (mathematics) Inner automorphism Intersection (set theory) Intersection number (graph theory) Intersection number Invertible matrix Jacobian matrix and determinant Knot theory Limit point Mapping class group Mapping cone (homological algebra) Mathematical induction Module (mathematics) Parity (mathematics) Poincaré conjecture Prime number Pullback (category theory) Quotient group Representation theory Residually finite group Riemann surface Seifert–van Kampen theorem Separatrix (mathematics) Set theory Simplicial complex Sphere theorem (3-manifolds) Sphere theorem Subgroup Sylow theorems Theorem Topology Union (set theory) Uniqueness theorem Variable (mathematics) Word problem (mathematics) |
| ISBN | 1-4008-8208-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- CONTENTS -- PREFACE -- I. Combinatorial Group Theory -- PROBLEMS IN COMBINATORIAL GROUP THEORY / Lyndon, Roger -- POINCARÉ DUALITY GROUPS OF DIMENSION TWO ARE SURFACE GROUPS / Eckmann, Beno -- HOW TO GENERALIZE ONE-RELATOR GROUP THEORY / Howie, James -- GRAPHICAL THEORY OF AUTOMORPHISMS OF FREE GROUPS / Stallings, John R. -- PEAK REDUCTION AND AUTOMORPHISMS OF FREE GROUPS AND FREE PRODUCTS / Collins, Donald J . -- NONSINGULAR EQUATIONS OF SMALL WEIGHT OVER GROUPS / Gersten, S. M. -- GRAPH-THEORETIC LEMMA AND GROUP-EMBEDDINGS / Stallings, John R. -- THE TODD-COXETER PROCESS, USING GRAPHS / Stallings, John R. / Wolf, A. Royce -- A SUBGROUP THEOREM FOR PREGROUPS / Rimlinger, Frank -- GROUPS WITH A RATIONAL CROSS-SECTION / Gilman, Robert H. -- ON THE RATIONAL GROWTH OF VIRTUALLY NILPOTENT GROUPS / Benson, Max -- SJOGREN'S THEOREM FOR DIMENSION SUBGROUPS - THE METABELIAN CASE -- ON GROUP PRESENTATIONS, COPRODUCTS AND INVERSES / Craggs, Robert / Howie, James -- ON COMPLEXES DOMINATED BY A TWO-COMPLEX / Ratcliffe, John G. -- SUBCOMPLEXES OF TWO-COMPLEXES AND PROJECTIVE CROSSED MODULES / Dyer, Micheal -- LENGTH FUNCTIONS OF GROUP ACTIONS ON A-TREES / Alperin, Roger / Bass, Hyman -- II. Very Low Dimensional Topology -- RESIDUAL FINITENESS FOR 3-MANIFOLDS / Hempel, John -- THE NIELSEN-THURSTON THEORY OF SURFACE AUTOMORPHISMS / Bleiler, Steven A. -- WHITEHEAD GROUPS OF CERTAIN HYPERBOLIC MANIFOLDS, II / Nicas, A. J / Stark, C.W. -- CHARACTERIZATION OF FINITE SUBGROUPS OF THE MAPPING-CLASS GROUP / Gilman, Jane -- A SEQUENCE OF PSEUDO-ANOSOV DIFFEOMORPHISMS / Neuwirth, L. / Patterson, N. -- DEHN'S ALGORITHM REVISITED, WITH APPLICATIONS TO SIMPLE CURVES ON SURFACES / Birman, Joan S. / Series, Caroline -- PATHS OF GEODESICS AND GEOMETRIC INTERSECTION NUMBERS: I / Cohen, Marshall / Lustig, Martin -- PATHS OF GEODESICS AND GEOMETRIC INTERSECTION NUMBERS: II / Lustig, Martin -- SELECTED PROBLEMS / Gersten, S. M. -- Backmatter |
| Record Nr. | UNINA-9910154748903321 |
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez
| Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez |
| Autore | Bullo Francesco |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, 2009 |
| Descrizione fisica | 1 online resource (333 p.) |
| Disciplina | 629.8/9246 |
| Altri autori (Persone) |
CortésJorge <1974->
MartínezSonia <1974-> |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Robotics
Computer algorithms Robots - Control systems |
| Soggetto non controllato |
1-center problem
Adjacency matrix Aggregate function Algebraic connectivity Algebraic topology (object) Algorithm Analysis of algorithms Approximation algorithm Asynchronous system Bellman–Ford algorithm Bifurcation theory Bounded set (topological vector space) Calculation Cartesian product Centroid Chebyshev center Circulant matrix Circumscribed circle Cluster analysis Combinatorial optimization Combinatorics Communication complexity Computation Computational complexity theory Computational geometry Computational model Computer simulation Computer vision Connected component (graph theory) Connectivity (graph theory) Consensus (computer science) Control function (econometrics) Differentiable function Dijkstra's algorithm Dimensional analysis Directed acyclic graph Directed graph Discrete time and continuous time Disk (mathematics) Distributed algorithm Doubly stochastic matrix Dynamical system Eigenvalues and eigenvectors Estimation Euclidean space Function composition Hybrid system Information theory Initial condition Instance (computer science) Invariance principle (linguistics) Invertible matrix Iteration Iterative method Kinematics Laplacian matrix Leader election Linear dynamical system Linear interpolation Linear programming Lipschitz continuity Lyapunov function Markov chain Mathematical induction Mathematical optimization Mobile robot Motion planning Multi-agent system Network model Network topology Norm (mathematics) Numerical integration Optimal control Optimization problem Parameter (computer programming) Partition of a set Percolation theory Permutation matrix Polytope Proportionality (mathematics) Quantifier (logic) Quantization (signal processing) Robustness (computer science) Scientific notation Sensor Set (mathematics) Simply connected space Simulation Simultaneous equations State space State variable Stochastic matrix Stochastic Strongly connected component Synchronous network Theorem Time complexity Topology Variable (mathematics) Vector field |
| ISBN |
1-68015-897-X
1-282-45820-5 1-282-93575-5 9786612458200 9786612935756 1-4008-3147-4 0-691-14195-9 |
| Classificazione | SK 880 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. An introduction to distributed algorithms -- Chapter Two. Geometric models and optimization -- Chapter Three. Robotic network models and complexity notions -- Chapter Four. Connectivity maintenance and rendezvous -- Chapter Five. Deployment -- Chapter Six. Boundary estimation and tracking -- Bibliography -- Algorithm Index -- Subject Index -- Symbol Index |
| Record Nr. | UNINA-9910781069103321 |
Bullo Francesco
|
||
| Princeton, NJ, : Princeton University Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Generalized Feynman Amplitudes. (AM-62), Volume 62 / / Eugene R. Speer
| Generalized Feynman Amplitudes. (AM-62), Volume 62 / / Eugene R. Speer |
| Autore | Speer Eugene R. |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (233 pages) |
| Disciplina | 530.14/3 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Mathematical physics
Quantum field theory |
| Soggetto non controllato |
Addition
Adjoint Amplitude Analytic continuation Analytic function Antiparticle C-number Calculation Change of variables Classical electromagnetism Coefficient Commutative property Compact space Complex analysis Complex number Connectivity (graph theory) Constant term Convolution Derivative Diagram (category theory) Differentiable function Distribution (mathematics) Equation Estimation Explicit formulae (L-function) Fermion Fock space Formal power series Fourier transform Free field Gauge theory Graph theory Hilbert space Incidence matrix Interaction picture Invertible matrix Irreducibility (mathematics) Isolated singularity Lagrangian (field theory) Laurent series Mathematical induction Mathematics Momentum Monomial Multiple integral National Science Foundation Notation Parameter Path integral formulation Permutation Polynomial Power series Probability Propagator Quadratic form Quantity Quantum field theory Remainder Renormalization Requirement S-matrix Scattering amplitude Scientific notation Second quantization Several complex variables Simple extension Special case Subset Subtraction Suggestion Summation Taylor series Tensor product Theorem Theory Topological space Translational symmetry Tree (data structure) Uniform convergence Vacuum expectation value Vacuum state Vacuum Variable (mathematics) Vector field Vector potential Wick's theorem Z0 |
| ISBN | 1-4008-8186-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Acknowledgements -- Abstract -- tables of contents -- Introductions -- CHAPTER I. Renormalization in Lagrangian Field Theory -- CHAPTER II. Definition of Generalized Amplitudes -- CHAPTER III. Analytic Renormalization -- CHAPTER IV. Summation of Feynman Amplitudes -- CONCLUSION -- APPENDIX A. Graphs -- APPENDIX B. Distributions -- APPENDIX C. The Free Field -- BIBLIOGRAPHY |
| Record Nr. | UNINA-9910154752403321 |
|
Speer Eugene R.
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910785659103321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Lectures on the theory of games [[electronic resource] /] / Harold W. Kuhn
| Lectures on the theory of games [[electronic resource] /] / Harold W. Kuhn |
| Autore | Kuhn Harold W (Harold William), <1925-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, 2003 |
| Descrizione fisica | 1 online resource (118 p.) |
| Disciplina | 519.3 |
| Collana | Annals of mathematics studies |
| Soggetto topico | Game theory |
| Soggetto non controllato |
Abstract algebra
Addition Algorithm Almost surely Analytic geometry Axiom Basic solution (linear programming) Big O notation Bijection Binary relation Boundary (topology) Bounded set (topological vector space) Branch point Calculation Cardinality of the continuum Cardinality Cartesian coordinate system Characteristic function (probability theory) Combination Computation Connectivity (graph theory) Constructive proof Convex combination Convex function Convex hull Convex set Coordinate system David Gale Diagram (category theory) Differential equation Dimension (vector space) Dimensional analysis Disjoint sets Distribution function Embedding Empty set Enumeration Equation Equilibrium point Equivalence relation Estimation Euclidean space Existential quantification Expected loss Extreme point Formal scheme Fundamental theorem Galois theory Geometry Hyperplane Inequality (mathematics) Infimum and supremum Integer Iterative method Line segment Linear equation Linear inequality Matching Pennies Mathematical induction Mathematical optimization Mathematical theory Mathematician Mathematics Matrix (mathematics) Measure (mathematics) Min-max theorem Minimum distance Mutual exclusivity Prediction Probability distribution Probability interpretations Probability measure Probability theory Probability Proof by contradiction Quantity Rank (linear algebra) Rational number Real number Requirement Scientific notation Sign (mathematics) Solution set Special case Statistics Strategist Strategy (game theory) Subset Theorem Theory of Games and Economic Behavior Theory Three-dimensional space (mathematics) Total order Two-dimensional space Union (set theory) Unit interval Unit square Vector Analysis Vector calculus Vector space |
| ISBN |
1-282-15911-9
9786612159114 1-4008-2956-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Author's Note -- Preface -- Chapter 1. What Is the Theory of Games? -- Chapter 2. Matrix Games -- Chapter 3. Extensive Games -- Chapter 4. Infinite Games -- Index |
| Record Nr. | UNINA-9910778215503321 |
|
Kuhn Harold W (Harold William), <1925->
|
||
| Princeton, N.J., : Princeton University Press, 2003 | ||
| 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 | ||
| ||