Resultado de la búsqueda
28 búsqueda de la palabra clave 'Problem'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : Algorithms and Programming : Problems and Solutions Tipo de documento: documento electrónico Autores: Shen, Alexander ; SpringerLink (Online service) Editorial: New York, NY : Springer New York Fecha de publicación: 2010 Otro editor: Imprint: Springer Colección: Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506 Número de páginas: XII, 272 p Il.: online resource ISBN/ISSN/DL: 978-1-4419-1748-5 Idioma : Inglés (eng) Palabras clave: Mathematics Computer programming Algorithms mathematics Numerical analysis Analysis Programming Techniques Computational and Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News Nota de contenido: Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR) En línea: http://dx.doi.org/10.1007/978-1-4419-1748-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33609 Algorithms and Programming : Problems and Solutions [documento electrónico] / Shen, Alexander ; SpringerLink (Online service) . - New York, NY : Springer New York : Imprint: Springer, 2010 . - XII, 272 p : online resource. - (Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506) .
ISBN : 978-1-4419-1748-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer programming Algorithms mathematics Numerical analysis Analysis Programming Techniques Computational and Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News Nota de contenido: Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR) En línea: http://dx.doi.org/10.1007/978-1-4419-1748-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33609 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar Harmonic Analysis, Signal Processing, and Complexity / SpringerLink (Online service) ; Irene Sabadini ; Daniele C. Struppa ; David F. Walnut (2005)
Título : Harmonic Analysis, Signal Processing, and Complexity : Festschrift in Honor of the 60th Birthday of Carlos A. Berenstein Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Irene Sabadini ; Daniele C. Struppa ; David F. Walnut Editorial: Boston, MA : Birkhäuser Boston Fecha de publicación: 2005 Colección: Progress in Mathematics num. 238 Número de páginas: XI, 162 p. 15 illus Il.: online resource ISBN/ISSN/DL: 978-0-8176-4416-1 Idioma : Inglés (eng) Palabras clave: Mathematics Algorithms Mathematical analysis Analysis (Mathematics) Harmonic Applied mathematics Engineering Abstract Applications of Signal, Image and Speech Processing Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: Carlos A. Berenstein has had a profound influence on scholars and practitioners alike amid a distinguished mathematical career spanning nearly four decades. His uncommon capability of adroitly moving between these parallel worlds is demonstrated by the breadth of his research interests, from his early theoretical work on interpolation in spaces of entire functions with growth conditions and residue theory to his later work on deconvolution and its applications to issues ranging from optics to the study of blood flow. This volume, which celebrates his sixtieth birthday, reflects the state-of-the-art in these areas. Original articles and survey articles, all refereed, cover topics in harmonic and complex analysis, as well as more applied work in signal processing. Contributors: C.A. Berenstein; R.W. Braun; O. Calin; D-C. Chang; G. Dafni; L. Ehrenpreis; G. Kaiser; C.O. Kiselman; P. Krishnaprasad; B.Q. Li; B. Matt; R. Meise; D. Napoletani; R. Poovendran; Y. Qiao; J. Ryan; C. Sadosky; D.C. Struppa; B.A. Taylor; J. Tie; D.F. Walnut; and A. Yger Nota de contenido: Some Novel Aspects of the Cauchy Problem -- Analytic and Algebraic Ideas: How to Profit from Their Complementarity -- On Certain First-Order Partial Differential Equations in C n -- Hermite Operator on the Heisenberg Group -- A Div-Curl Lemma in BMO on a Domain -- Subharmonic Functions on Discrete Structures -- Nearly Hyperbolic Varieties and Phragmén-Lindelöf Conditions -- Sampling and Local Deconvolution -- Orthogonal Projections on Hyperbolic Space -- Eigenwavelets of the Wave Equation -- Security Analysis and Extensions of the PCB Algorithm for Distributed Key Generation -- Quotient Signal Estimation En línea: http://dx.doi.org/10.1007/0-8176-4416-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35174 Harmonic Analysis, Signal Processing, and Complexity : Festschrift in Honor of the 60th Birthday of Carlos A. Berenstein [documento electrónico] / SpringerLink (Online service) ; Irene Sabadini ; Daniele C. Struppa ; David F. Walnut . - Boston, MA : Birkhäuser Boston, 2005 . - XI, 162 p. 15 illus : online resource. - (Progress in Mathematics; 238) .
ISBN : 978-0-8176-4416-1
Idioma : Inglés (eng)
Palabras clave: Mathematics Algorithms Mathematical analysis Analysis (Mathematics) Harmonic Applied mathematics Engineering Abstract Applications of Signal, Image and Speech Processing Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: Carlos A. Berenstein has had a profound influence on scholars and practitioners alike amid a distinguished mathematical career spanning nearly four decades. His uncommon capability of adroitly moving between these parallel worlds is demonstrated by the breadth of his research interests, from his early theoretical work on interpolation in spaces of entire functions with growth conditions and residue theory to his later work on deconvolution and its applications to issues ranging from optics to the study of blood flow. This volume, which celebrates his sixtieth birthday, reflects the state-of-the-art in these areas. Original articles and survey articles, all refereed, cover topics in harmonic and complex analysis, as well as more applied work in signal processing. Contributors: C.A. Berenstein; R.W. Braun; O. Calin; D-C. Chang; G. Dafni; L. Ehrenpreis; G. Kaiser; C.O. Kiselman; P. Krishnaprasad; B.Q. Li; B. Matt; R. Meise; D. Napoletani; R. Poovendran; Y. Qiao; J. Ryan; C. Sadosky; D.C. Struppa; B.A. Taylor; J. Tie; D.F. Walnut; and A. Yger Nota de contenido: Some Novel Aspects of the Cauchy Problem -- Analytic and Algebraic Ideas: How to Profit from Their Complementarity -- On Certain First-Order Partial Differential Equations in C n -- Hermite Operator on the Heisenberg Group -- A Div-Curl Lemma in BMO on a Domain -- Subharmonic Functions on Discrete Structures -- Nearly Hyperbolic Varieties and Phragmén-Lindelöf Conditions -- Sampling and Local Deconvolution -- Orthogonal Projections on Hyperbolic Space -- Eigenwavelets of the Wave Equation -- Security Analysis and Extensions of the PCB Algorithm for Distributed Key Generation -- Quotient Signal Estimation En línea: http://dx.doi.org/10.1007/0-8176-4416-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35174 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Mathematical Aspects of Network Routing Optimization Tipo de documento: documento electrónico Autores: Carlos A. S. Oliveira ; SpringerLink (Online service) ; Panos M. Pardalos Editorial: New York, NY : Springer New York Fecha de publicación: 2011 Otro editor: Imprint: Springer Colección: Springer Optimization and Its Applications, ISSN 1931-6828 num. 53 Número de páginas: XXIV, 208 p Il.: online resource ISBN/ISSN/DL: 978-1-4614-0311-1 Idioma : Inglés (eng) Palabras clave: Mathematics Computer communication systems Algorithms Mathematical optimization Optimization Communication Networks Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity Clasificación: 51 Matemáticas Resumen: Mathematical Aspects of Network Routing Optimization provides a thorough introduction to the subject of algorithms for network routing and focuses on multicast and wireless ad hoc systems. The modern world is connected through large-scale, computational networked systems such as the Internet and because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. This work focuses on computational issues arising from the process of optimizing network routes, such as the quality of resulting links and their reliability. Algorithms are key to understanding the protocols underlying multicast routing. The main objective in the text is to derive efficient algorithms, with or without the guarantee of approximation, that can be applied to address these problems. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms Nota de contenido: Preface -- 1. Unicast Routing Algorithms -- 2. Multicast Routing -- 3. Steiner Trees and Multicast -- 4. Online Multicast Routing -- 5. Distributed Algorithms for Multicast Routing -- 6. Center-Based Trees and Multicast Packing -- 7. Metaheuristics for Multicast Routing -- 8. The Point-to-Point Connection Problem -- 9. Streaming Cache Placement -- 10. Algorithms for Cache Placement -- 11. Distributed Routing on Ad Hoc Networks -- 12. Power-Aware Routing in MANETs -- Appendix -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-4614-0311-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33218 Mathematical Aspects of Network Routing Optimization [documento electrónico] / Carlos A. S. Oliveira ; SpringerLink (Online service) ; Panos M. Pardalos . - New York, NY : Springer New York : Imprint: Springer, 2011 . - XXIV, 208 p : online resource. - (Springer Optimization and Its Applications, ISSN 1931-6828; 53) .
ISBN : 978-1-4614-0311-1
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer communication systems Algorithms Mathematical optimization Optimization Communication Networks Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity Clasificación: 51 Matemáticas Resumen: Mathematical Aspects of Network Routing Optimization provides a thorough introduction to the subject of algorithms for network routing and focuses on multicast and wireless ad hoc systems. The modern world is connected through large-scale, computational networked systems such as the Internet and because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. This work focuses on computational issues arising from the process of optimizing network routes, such as the quality of resulting links and their reliability. Algorithms are key to understanding the protocols underlying multicast routing. The main objective in the text is to derive efficient algorithms, with or without the guarantee of approximation, that can be applied to address these problems. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms Nota de contenido: Preface -- 1. Unicast Routing Algorithms -- 2. Multicast Routing -- 3. Steiner Trees and Multicast -- 4. Online Multicast Routing -- 5. Distributed Algorithms for Multicast Routing -- 6. Center-Based Trees and Multicast Packing -- 7. Metaheuristics for Multicast Routing -- 8. The Point-to-Point Connection Problem -- 9. Streaming Cache Placement -- 10. Algorithms for Cache Placement -- 11. Distributed Routing on Ad Hoc Networks -- 12. Power-Aware Routing in MANETs -- Appendix -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-4614-0311-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33218 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Multi Tenancy for Cloud-Based In-Memory Column Databases : Workload Management and Data Placement Tipo de documento: documento electrónico Autores: Schaffner, Jan ; SpringerLink (Online service) Editorial: Heidelberg : Springer International Publishing Fecha de publicación: 2014 Otro editor: Imprint: Springer Colección: In-Memory Data Management Research, ISSN 2196-8055 Número de páginas: XIII, 128 p Il.: online resource ISBN/ISSN/DL: 978-3-319-00497-6 Idioma : Inglés (eng) Palabras clave: Business Information technology Data processing Algorithms Computers Database management Mathematical optimization and Management IT in Algorithm Analysis Problem Complexity Models Principles Discrete Optimization Clasificación: 658 Empresas. Organización de empresas Resumen: With the proliferation of Software-as-a-Service (SaaS) offerings, it is becoming increasingly important for individual SaaS providers to operate their services at a low cost. This book investigates SaaS from the perspective of the provider and shows how operational costs can be reduced by using “multi tenancy,” a technique for consolidating a large number of customers onto a small number of servers. Specifically, the book addresses multi tenancy on the database level, focusing on in-memory column databases, which are the backbone of many important new enterprise applications. For efficiently implementing multi tenancy in a farm of databases, two fundamental challenges must be addressed, (i) workload modeling and (ii) data placement. The first involves estimating the (shared) resource consumption for multi tenancy on a single in-memory database server. The second consists in assigning tenants to servers in a way that minimizes the number of required servers (and thus costs) based on the assumed workload model. This step also entails replicating tenants for performance and high availability. This book presents novel solutions to both problems Nota de contenido: 1. Introduction -- 2. Background and Motivation -- 3. A Model for Load Management and Response Time Prediction -- 4. The Robust Tenant Placement and Migration Problem -- 5. Algorithms for RTP -- 6. Experimental Evaluation -- 7. Related Work -- 8. Conclusions and Perspectives En línea: http://dx.doi.org/10.1007/978-3-319-00497-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35962 Multi Tenancy for Cloud-Based In-Memory Column Databases : Workload Management and Data Placement [documento electrónico] / Schaffner, Jan ; SpringerLink (Online service) . - Heidelberg : Springer International Publishing : Imprint: Springer, 2014 . - XIII, 128 p : online resource. - (In-Memory Data Management Research, ISSN 2196-8055) .
ISBN : 978-3-319-00497-6
Idioma : Inglés (eng)
Palabras clave: Business Information technology Data processing Algorithms Computers Database management Mathematical optimization and Management IT in Algorithm Analysis Problem Complexity Models Principles Discrete Optimization Clasificación: 658 Empresas. Organización de empresas Resumen: With the proliferation of Software-as-a-Service (SaaS) offerings, it is becoming increasingly important for individual SaaS providers to operate their services at a low cost. This book investigates SaaS from the perspective of the provider and shows how operational costs can be reduced by using “multi tenancy,” a technique for consolidating a large number of customers onto a small number of servers. Specifically, the book addresses multi tenancy on the database level, focusing on in-memory column databases, which are the backbone of many important new enterprise applications. For efficiently implementing multi tenancy in a farm of databases, two fundamental challenges must be addressed, (i) workload modeling and (ii) data placement. The first involves estimating the (shared) resource consumption for multi tenancy on a single in-memory database server. The second consists in assigning tenants to servers in a way that minimizes the number of required servers (and thus costs) based on the assumed workload model. This step also entails replicating tenants for performance and high availability. This book presents novel solutions to both problems Nota de contenido: 1. Introduction -- 2. Background and Motivation -- 3. A Model for Load Management and Response Time Prediction -- 4. The Robust Tenant Placement and Migration Problem -- 5. Algorithms for RTP -- 6. Experimental Evaluation -- 7. Related Work -- 8. Conclusions and Perspectives En línea: http://dx.doi.org/10.1007/978-3-319-00497-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35962 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Optimization in Public Transportation : Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network Tipo de documento: documento electrónico Autores: Schöbel, Anita ; SpringerLink (Online service) Editorial: Boston, MA : Springer US Fecha de publicación: 2006 Colección: Springer Optimization and Its Applications, ISSN 1931-6828 num. 3 Número de páginas: XIV, 268 p Il.: online resource ISBN/ISSN/DL: 978-0-387-36643-2 Idioma : Inglés (eng) Palabras clave: Mathematics Operations research Decision making Computer programming Algorithms Mathematical optimization Management science Optimization Research, Science Programming Techniques Operation Research/Decision Theory Algorithm Analysis and Problem Complexity Clasificación: 51 Matemáticas Resumen: Customer-Oriented Optimization in Public Transportation develops models, results and algorithms for optimizing public transportation from a customer-oriented point of view. The methods used are based on graph-theoretic approaches and integer programming. The specific topics are all motivated by real-world examples which occurred in practical projects. An appendix summarizes some of the basics of optimization needed to interpret the material in the book. In detail, the topics the book covers in its three parts are as follows: 1. Stop location. Does it make sense to open new stations along existing bus or railway lines? If yes, in which locations? The problem is modeled as a continuous covering problem. To solve it the author develops a finite dominating set and shows that efficient methods are possible if the special structure of the covering matrix is used. 2. Delay management. Should a train wait for delayed feeder trains or should it depart in time? The author builds up two different integer programming models and a model based on project planning methods. Properties and solution methods are developed. 3. Tariff planning. Part 3 deals with the design of zone tariff systems, in which the fare is determined by the number of zones used by the passengers. The author presents a model for this problem and approaches based on clustering theory. Audience This book is intended for operations research graduate students and researchers interested in a practical introduction to integer programming and algorithms Nota de contenido: Customer-oriented Traffic Planning -- Customer-oriented Traffic Planning -- Stop Location -- Covering All Demand Points -- Bicriteria Stop Location -- Extensions -- Delay Management -- Delay Management With Fixed Connections -- Minimizing the Sum of All Delays -- The Bicriteria Delay Management Problem -- Extensions -- Tariff Planning -- Finding Zones and Zone Prices En línea: http://dx.doi.org/10.1007/978-0-387-36643-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34833 Optimization in Public Transportation : Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network [documento electrónico] / Schöbel, Anita ; SpringerLink (Online service) . - Boston, MA : Springer US, 2006 . - XIV, 268 p : online resource. - (Springer Optimization and Its Applications, ISSN 1931-6828; 3) .
ISBN : 978-0-387-36643-2
Idioma : Inglés (eng)
Palabras clave: Mathematics Operations research Decision making Computer programming Algorithms Mathematical optimization Management science Optimization Research, Science Programming Techniques Operation Research/Decision Theory Algorithm Analysis and Problem Complexity Clasificación: 51 Matemáticas Resumen: Customer-Oriented Optimization in Public Transportation develops models, results and algorithms for optimizing public transportation from a customer-oriented point of view. The methods used are based on graph-theoretic approaches and integer programming. The specific topics are all motivated by real-world examples which occurred in practical projects. An appendix summarizes some of the basics of optimization needed to interpret the material in the book. In detail, the topics the book covers in its three parts are as follows: 1. Stop location. Does it make sense to open new stations along existing bus or railway lines? If yes, in which locations? The problem is modeled as a continuous covering problem. To solve it the author develops a finite dominating set and shows that efficient methods are possible if the special structure of the covering matrix is used. 2. Delay management. Should a train wait for delayed feeder trains or should it depart in time? The author builds up two different integer programming models and a model based on project planning methods. Properties and solution methods are developed. 3. Tariff planning. Part 3 deals with the design of zone tariff systems, in which the fare is determined by the number of zones used by the passengers. The author presents a model for this problem and approaches based on clustering theory. Audience This book is intended for operations research graduate students and researchers interested in a practical introduction to integer programming and algorithms Nota de contenido: Customer-oriented Traffic Planning -- Customer-oriented Traffic Planning -- Stop Location -- Covering All Demand Points -- Bicriteria Stop Location -- Extensions -- Delay Management -- Delay Management With Fixed Connections -- Minimizing the Sum of All Delays -- The Bicriteria Delay Management Problem -- Extensions -- Tariff Planning -- Finding Zones and Zone Prices En línea: http://dx.doi.org/10.1007/978-0-387-36643-2 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34833 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar PermalinkPermalinkPermalinkPermalinkPermalink
