Resultado de la búsqueda
98 búsqueda de la palabra clave 'Discrete'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsquedaDiscrete Differential Geometry / SpringerLink (Online service) ; Bobenko, Alexander I ; Sullivan, John M ; Schröder, Peter ; Ziegler, Günter M (2008)
Título : Discrete Differential Geometry Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Bobenko, Alexander I ; Sullivan, John M ; Schröder, Peter ; Ziegler, Günter M Editorial: Basel : Birkhäuser Basel Fecha de publicación: 2008 Colección: Oberwolfach Seminars num. 38 Número de páginas: X, 341 p Il.: online resource ISBN/ISSN/DL: 978-3-7643-8621-4 Idioma : Inglés (eng) Palabras clave: Mathematics Convex geometry Discrete Differential and Geometry Clasificación: 51 Matemáticas Resumen: Discrete differential geometry is an active mathematical terrain where differential geometry and discrete geometry meet and interact. It provides discrete equivalents of the geometric notions and methods of differential geometry, such as notions of curvature and integrability for polyhedral surfaces. Current progress in this field is to a large extent stimulated by its relevance for computer graphics and mathematical physics. This collection of essays, which documents the main lectures of the 2004 Oberwolfach Seminar on the topic, as well as a number of additional contributions by key participants, gives a lively, multi-facetted introduction to this emerging field Nota de contenido: Discretization of Surfaces: Special Classes and Parametrizations -- Surfaces from Circles -- Minimal Surfaces from Circle Patterns: Boundary Value Problems, Examples -- Designing Cylinders with Constant Negative Curvature -- On the Integrability of Infinitesimal and Finite Deformations of Polyhedral Surfaces -- Discrete Hashimoto Surfaces and a Doubly Discrete Smoke-Ring Flow -- The Discrete Green’s Function -- Curvatures of Discrete Curves and Surfaces -- Curves of Finite Total Curvature -- Convergence and Isotopy Type for Graphs of Finite Total Curvature -- Curvatures of Smooth and Discrete Surfaces -- Geometric Realizations of Combinatorial Surfaces -- Polyhedral Surfaces of High Genus -- Necessary Conditions for Geometric Realizability of Simplicial Complexes -- Enumeration and Random Realization of Triangulated Surfaces -- On Heuristic Methods for Finding Realizations of Surfaces -- Geometry Processing and Modeling with Discrete Differential Geometry -- What Can We Measure? -- Convergence of the Cotangent Formula: An Overview -- Discrete Differential Forms for Computational Modeling -- A Discrete Model of Thin Shells En línea: http://dx.doi.org/10.1007/978-3-7643-8621-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34401 Discrete Differential Geometry [documento electrónico] / SpringerLink (Online service) ; Bobenko, Alexander I ; Sullivan, John M ; Schröder, Peter ; Ziegler, Günter M . - Basel : Birkhäuser Basel, 2008 . - X, 341 p : online resource. - (Oberwolfach Seminars; 38) .
ISBN : 978-3-7643-8621-4
Idioma : Inglés (eng)
Palabras clave: Mathematics Convex geometry Discrete Differential and Geometry Clasificación: 51 Matemáticas Resumen: Discrete differential geometry is an active mathematical terrain where differential geometry and discrete geometry meet and interact. It provides discrete equivalents of the geometric notions and methods of differential geometry, such as notions of curvature and integrability for polyhedral surfaces. Current progress in this field is to a large extent stimulated by its relevance for computer graphics and mathematical physics. This collection of essays, which documents the main lectures of the 2004 Oberwolfach Seminar on the topic, as well as a number of additional contributions by key participants, gives a lively, multi-facetted introduction to this emerging field Nota de contenido: Discretization of Surfaces: Special Classes and Parametrizations -- Surfaces from Circles -- Minimal Surfaces from Circle Patterns: Boundary Value Problems, Examples -- Designing Cylinders with Constant Negative Curvature -- On the Integrability of Infinitesimal and Finite Deformations of Polyhedral Surfaces -- Discrete Hashimoto Surfaces and a Doubly Discrete Smoke-Ring Flow -- The Discrete Green’s Function -- Curvatures of Discrete Curves and Surfaces -- Curves of Finite Total Curvature -- Convergence and Isotopy Type for Graphs of Finite Total Curvature -- Curvatures of Smooth and Discrete Surfaces -- Geometric Realizations of Combinatorial Surfaces -- Polyhedral Surfaces of High Genus -- Necessary Conditions for Geometric Realizability of Simplicial Complexes -- Enumeration and Random Realization of Triangulated Surfaces -- On Heuristic Methods for Finding Realizations of Surfaces -- Geometry Processing and Modeling with Discrete Differential Geometry -- What Can We Measure? -- Convergence of the Cotangent Formula: An Overview -- Discrete Differential Forms for Computational Modeling -- A Discrete Model of Thin Shells En línea: http://dx.doi.org/10.1007/978-3-7643-8621-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34401 Ejemplares
Signatura Medio Ubicación Sección Estado ningún ejemplar
Título : Discrete Geometry and Optimization Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Károly Bezdek ; Deza, Antoine ; Ye, Yinyu Editorial: Heidelberg : Springer International Publishing Fecha de publicación: 2013 Otro editor: Imprint: Springer Colección: Fields Institute Communications, ISSN 1069-5265 num. 69 Número de páginas: X, 336 p Il.: online resource ISBN/ISSN/DL: 978-3-319-00200-2 Idioma : Inglés (eng) Palabras clave: Mathematics Convex geometry Discrete Operations research Management science Mathematical optimization and Geometry Optimization Research, Science Clasificación: 51 Matemáticas Resumen: Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems Nota de contenido: Preface -- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova) -- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer) -- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher) -- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek) -- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar) -- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis) -- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales) -- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh) -- Techniques for Submodular Maximization (Lee) -- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza) -- Expected Crossing Numbers (Mohar, Stephen) -- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump) -- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini) -- Exploiting Symmetries in Polyhedral Computations (Schurmann) -- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye) -- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena) -- Open Problems (Bezdek, Deza, and Ye). En línea: http://dx.doi.org/10.1007/978-3-319-00200-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32455 Discrete Geometry and Optimization [documento electrónico] / SpringerLink (Online service) ; Károly Bezdek ; Deza, Antoine ; Ye, Yinyu . - Heidelberg : Springer International Publishing : Imprint: Springer, 2013 . - X, 336 p : online resource. - (Fields Institute Communications, ISSN 1069-5265; 69) .
ISBN : 978-3-319-00200-2
Idioma : Inglés (eng)
Palabras clave: Mathematics Convex geometry Discrete Operations research Management science Mathematical optimization and Geometry Optimization Research, Science Clasificación: 51 Matemáticas Resumen: Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems Nota de contenido: Preface -- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova) -- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer) -- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher) -- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek) -- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar) -- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis) -- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales) -- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh) -- Techniques for Submodular Maximization (Lee) -- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza) -- Expected Crossing Numbers (Mohar, Stephen) -- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump) -- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini) -- Exploiting Symmetries in Polyhedral Computations (Schurmann) -- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye) -- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena) -- Open Problems (Bezdek, Deza, and Ye). En línea: http://dx.doi.org/10.1007/978-3-319-00200-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32455 Ejemplares
Signatura Medio Ubicación Sección Estado ningún ejemplar
Título : Twentieth Anniversary Volume : Discrete & Computational Geometry Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Pollack, Richard ; Pach, János ; Goodman, Jacob E Editorial: New York, NY : Springer New York Fecha de publicación: 2009 Número de páginas: XVIII, 635 p. 212 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-87363-3 Idioma : Inglés (eng) Palabras clave: Mathematics Computer science graphics Algebraic geometry mathematics Convex Discrete and Geometry in Science Graphics Computational Numerical Analysis Clasificación: 51 Matemáticas Resumen: This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal. The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years. Contributors include: E. Ackerman P.K. Agarwal I. Aliev I. Bárány A. Barvinok S. Basu L.J. Billera J.-D. Boissonnat C. Borcea E. Boros K. Borys B. Braun K. Buchin O. Cheong D. Cohen-Steiner M. Damian K. Elbassioni R. Flatland T. Gerken J.E. Goodman X. Goaoc P. Gronchi V. Gurvich S. Har-Peled J. Hershberger A. Holmsen S.K. Hsiao A. Hubard J. Jerónimo L. Khachiyan R. Klein C. Knauer S. Langerman J.-Y. Lee M. Longinetti E. Miller P. Morin U. Nagel E. Nevo P. Niyogi I. Novik J. O’Rourke J. Pach I. Pak M.J. Pelsmajer S. Petitjean F. Pfender R. Pinchasi R. Pollack J.S. Provan K. Przeslawski R.M. Richardson G. Rote M. Schaefer Y. Schreiber M. Sharir J.R. Shewchuk S. Smale B. Solomyak M. Soss D. Štefankovic G. Vegter V.H. Vu S. Weinberger L. Wu D. Yost H. Yu T. Zell Nota de contenido: There Are Not Too Many Magic Configurations -- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles -- Robust Shape Fitting via Peeling and Grating Coresets -- Siegel’s Lemma and Sum-Distinct Sets -- Slicing Convex Sets and Measures by a Hyperplane -- A Centrally Symmetric Version of the Cyclic Polytope -- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities -- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres -- Isotopic Implicit Surface Meshing -- Line Transversals to Disjoint Balls -- Norm Bounds for Ehrhart Polynomial Roots -- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Empty Convex Hexagons in Planar Point Sets -- Affinely Regular Polygons as Extremals of Area Functionals -- Improved Output-Sensitive Snap Rounding -- Generating All Vertices of a Polyhedron Is Hard -- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property -- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings -- Empty Simplices of Polytopes and Graded Betti Numbers -- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes -- Finding the Homology of Submanifolds with High Confidence from Random Samples -- Odd Crossing Number and Crossing Number Are Not the Same -- Visibility Graphs of Point Sets in the Plane -- Decomposability of Polytopes -- An Inscribing Model for Random Polytopes -- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions -- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties En línea: http://dx.doi.org/10.1007/978-0-387-87363-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33901 Twentieth Anniversary Volume : Discrete & Computational Geometry [documento electrónico] / SpringerLink (Online service) ; Pollack, Richard ; Pach, János ; Goodman, Jacob E . - New York, NY : Springer New York, 2009 . - XVIII, 635 p. 212 illus : online resource.
ISBN : 978-0-387-87363-3
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer science graphics Algebraic geometry mathematics Convex Discrete and Geometry in Science Graphics Computational Numerical Analysis Clasificación: 51 Matemáticas Resumen: This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal. The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years. Contributors include: E. Ackerman P.K. Agarwal I. Aliev I. Bárány A. Barvinok S. Basu L.J. Billera J.-D. Boissonnat C. Borcea E. Boros K. Borys B. Braun K. Buchin O. Cheong D. Cohen-Steiner M. Damian K. Elbassioni R. Flatland T. Gerken J.E. Goodman X. Goaoc P. Gronchi V. Gurvich S. Har-Peled J. Hershberger A. Holmsen S.K. Hsiao A. Hubard J. Jerónimo L. Khachiyan R. Klein C. Knauer S. Langerman J.-Y. Lee M. Longinetti E. Miller P. Morin U. Nagel E. Nevo P. Niyogi I. Novik J. O’Rourke J. Pach I. Pak M.J. Pelsmajer S. Petitjean F. Pfender R. Pinchasi R. Pollack J.S. Provan K. Przeslawski R.M. Richardson G. Rote M. Schaefer Y. Schreiber M. Sharir J.R. Shewchuk S. Smale B. Solomyak M. Soss D. Štefankovic G. Vegter V.H. Vu S. Weinberger L. Wu D. Yost H. Yu T. Zell Nota de contenido: There Are Not Too Many Magic Configurations -- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles -- Robust Shape Fitting via Peeling and Grating Coresets -- Siegel’s Lemma and Sum-Distinct Sets -- Slicing Convex Sets and Measures by a Hyperplane -- A Centrally Symmetric Version of the Cyclic Polytope -- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities -- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres -- Isotopic Implicit Surface Meshing -- Line Transversals to Disjoint Balls -- Norm Bounds for Ehrhart Polynomial Roots -- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Empty Convex Hexagons in Planar Point Sets -- Affinely Regular Polygons as Extremals of Area Functionals -- Improved Output-Sensitive Snap Rounding -- Generating All Vertices of a Polyhedron Is Hard -- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property -- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings -- Empty Simplices of Polytopes and Graded Betti Numbers -- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes -- Finding the Homology of Submanifolds with High Confidence from Random Samples -- Odd Crossing Number and Crossing Number Are Not the Same -- Visibility Graphs of Point Sets in the Plane -- Decomposability of Polytopes -- An Inscribing Model for Random Polytopes -- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions -- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties En línea: http://dx.doi.org/10.1007/978-0-387-87363-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33901 Ejemplares
Signatura Medio Ubicación Sección Estado ningún ejemplar
Título : Optimization of Stochastic Discrete Systems and Control on Complex Networks : Computational Networks Tipo de documento: documento electrónico Autores: Lozovanu, Dmitrii ; SpringerLink (Online service) ; Pickl, Stefan Editorial: Cham : Springer International Publishing Fecha de publicación: 2015 Otro editor: Imprint: Springer Colección: Advances in Computational Management Science, ISSN 1388-4301 num. 12 Número de páginas: XIX, 400 p. 54 illus Il.: online resource ISBN/ISSN/DL: 978-3-319-11833-8 Idioma : Inglés (eng) Palabras clave: Business Operations research Decision making Algorithms Mathematical optimization Management science and Operation Research/Decision Theory Optimization Research, Science Discrete Algorithm Analysis Problem Complexity Clasificación: 658 Empresas. Organización de empresas Resumen: This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors’ new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book’s final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory Nota de contenido: Discrete stochastic processes, numerical methods for Markov chains and polynomial time algorithms -- Stochastic optimal control problems and Markov decision processes with infinite time horizon -- A game-theoretical approach to Markov decision processes, stochastic positional games and multicriteria control models -- Dynamic programming algorithms for finite horizon control problems and Markov decision processes En línea: http://dx.doi.org/10.1007/978-3-319-11833-8 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35502 Optimization of Stochastic Discrete Systems and Control on Complex Networks : Computational Networks [documento electrónico] / Lozovanu, Dmitrii ; SpringerLink (Online service) ; Pickl, Stefan . - Cham : Springer International Publishing : Imprint: Springer, 2015 . - XIX, 400 p. 54 illus : online resource. - (Advances in Computational Management Science, ISSN 1388-4301; 12) .
ISBN : 978-3-319-11833-8
Idioma : Inglés (eng)
Palabras clave: Business Operations research Decision making Algorithms Mathematical optimization Management science and Operation Research/Decision Theory Optimization Research, Science Discrete Algorithm Analysis Problem Complexity Clasificación: 658 Empresas. Organización de empresas Resumen: This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors’ new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book’s final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory Nota de contenido: Discrete stochastic processes, numerical methods for Markov chains and polynomial time algorithms -- Stochastic optimal control problems and Markov decision processes with infinite time horizon -- A game-theoretical approach to Markov decision processes, stochastic positional games and multicriteria control models -- Dynamic programming algorithms for finite horizon control problems and Markov decision processes En línea: http://dx.doi.org/10.1007/978-3-319-11833-8 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35502 Ejemplares
Signatura Medio Ubicación Sección Estado ningún ejemplar
Título : CATBox : An Interactive Course in Combinatorial Optimization Tipo de documento: documento electrónico Autores: Hochstättler, Winfried ; SpringerLink (Online service) ; Schliep, Alexander Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2010 Número de páginas: XII, 190 p. 36 illus Il.: online resource ISBN/ISSN/DL: 978-3-642-03822-8 Idioma : Inglés (eng) Palabras clave: Mathematics Computer science Game theory Mathematical optimization Operations research Management Discrete mathematics Combinatorics Theory, Economics, Social and Behav. Sciences Optimization Research, Science in Clasificación: 51 Matemáticas Resumen: Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone. CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. He or she can set breakpoints, proceed in single steps and trace into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide visual feedback. The course book, intended for readers at advanced undergraduate or graduate level, introduces the ideas and discusses the mathematical background necessary for understanding and verifying the correctness of the algorithms and their complexity. Computer exercises and examples replace the usual static pictures of algorithm dynamics. For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows as well as weighted and unweighted matchings both for bipartite and non-bipartite graphs. We consider non-bipartite weighted matching, in particular in the geometrical case, a highlight of combinatorial optimization. In order to enable the reader to fully enjoy the beauty of the primal-dual solution algorithm for weighted matching, we present all mathematical material not only from the point of view of graph theory, but also with an emphasis on linear programming and its duality. This yields insightful and aesthetically pleasing pictures for matchings, but also for minimum spanning trees. You can find more information at http://schliep.org/CATBox/ Nota de contenido: Discrete Problems from Applications -- Basics, Notation and Data Structures -- Minimum Spanning Trees -- Linear Programming Duality -- Shortest Paths -- Maximal Flows -- Minimum-Cost Flows -- Matching -- Weighted Matching En línea: http://dx.doi.org/10.1007/978-3-642-03822-8 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33717 CATBox : An Interactive Course in Combinatorial Optimization [documento electrónico] / Hochstättler, Winfried ; SpringerLink (Online service) ; Schliep, Alexander . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2010 . - XII, 190 p. 36 illus : online resource.
ISBN : 978-3-642-03822-8
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer science Game theory Mathematical optimization Operations research Management Discrete mathematics Combinatorics Theory, Economics, Social and Behav. Sciences Optimization Research, Science in Clasificación: 51 Matemáticas Resumen: Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone. CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. He or she can set breakpoints, proceed in single steps and trace into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide visual feedback. The course book, intended for readers at advanced undergraduate or graduate level, introduces the ideas and discusses the mathematical background necessary for understanding and verifying the correctness of the algorithms and their complexity. Computer exercises and examples replace the usual static pictures of algorithm dynamics. For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows as well as weighted and unweighted matchings both for bipartite and non-bipartite graphs. We consider non-bipartite weighted matching, in particular in the geometrical case, a highlight of combinatorial optimization. In order to enable the reader to fully enjoy the beauty of the primal-dual solution algorithm for weighted matching, we present all mathematical material not only from the point of view of graph theory, but also with an emphasis on linear programming and its duality. This yields insightful and aesthetically pleasing pictures for matchings, but also for minimum spanning trees. You can find more information at http://schliep.org/CATBox/ Nota de contenido: Discrete Problems from Applications -- Basics, Notation and Data Structures -- Minimum Spanning Trees -- Linear Programming Duality -- Shortest Paths -- Maximal Flows -- Minimum-Cost Flows -- Matching -- Weighted Matching En línea: http://dx.doi.org/10.1007/978-3-642-03822-8 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33717 Ejemplares
Signatura Medio Ubicación Sección Estado ningún ejemplar PermalinkPermalink
Permalink
PermalinkPermalink
