TOP
紅利積點抵現金,消費購書更貼心
搜尋結果 /

Grokking Algorithms

4510
2 / 113
Sublinear Algorithms for Big Data Applications
90 折
出版日:2015/08/20 作者:Dan Wang; Zhu Han  出版社:Springer Verlag  裝訂:平裝
The brief focuses on applying sublinear algorithms to manage critical big data challenges. The text offers an essential introduction to sublinear algorithms, explaining why they are vital to large sca
優惠價: 9 2835
無庫存
Genetic Algorithms in Java
滿額折
出版日:2015/02/18 作者:Lee Jacobson  出版社:Springer-Verlag New York Inc  裝訂:平裝
Genetic Algorithms in Java is an applied approach to learning and solving problems using genetic algorithms, with working projects and solutions written in the Java programming language. This book wil
優惠價: 1 3479
無庫存
Quantum Algorithms via Linear Algebra ─ A Primer
79 折
出版日:2014/12/05 作者:Richard J. Lipton; Kenneth W Regan  出版社:Mit Pr  裝訂:精裝
This introduction to quantum algorithms is concise but comprehensive, covering many key algorithms. It is mathematically rigorous but requires minimal background and assumes no knowledge of quantum th
優惠價: 79 1351
無庫存
Integer Algorithms in Cryptology and Information Assurance
滿額折
出版日:2014/11/30 作者:Boris S. Verkhovsky  出版社:World Scientific Pub Co Inc  裝訂:精裝
Integer Algorithms in Cryptology and Information Assurance is a collection of the author's own innovative approaches in algorithms and protocols for secret and reliable communication. It concentrates
優惠價: 9 4345
無庫存
Algorithms for Obstetrics and Gynaecology
90 折
出版日:2014/04/06 作者:Sambit Mukhopadhyay (EDT); Edward Morris (EDT); Sabaratnam Arulkumaran (EDT)  出版社:OUP Academic UK  裝訂:平裝
Algorithms in Obstetrics and Gynaecology presents the core knowledge needed to tackle all situations in obstetrics and gynaecology, in a structured fashion. All algorithms are designed to support rapi
優惠價: 9 2862
無庫存
Genetic Algorithms + Data Structures = Evolution Programs
90 折
出版日:2014/03/31 作者:Zbigniew Michalewicz  出版社:Springer-Verlag New York Inc  裝訂:平裝
Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimiza
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2014/02/26 作者:Richard Neapolitan; Kumarss Naimipour  出版社:Jones & Bartlett Learning  裝訂:平裝
This algorithms text from Neapolitan focuses on algorithms design and complexity analysis, assumes a background of college algebra and data structures but no calculus, and is suggested for a one-semes
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2013/12/09 作者:Claus Weihs; Olaf Mersmann; Uwe Ligges  出版社:Taylor & Francis  裝訂:精裝
Reviewing the historical development of basic algorithms to illuminate the evolution of today’s more powerful statistical algorithms, this comprehensive textbook emphasizes recurring themes in all sta
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Kernel Learning Algorithms for Face Recognition
90 折
出版日:2013/09/19 作者:Jun-bao Li  出版社:Springer Verlag  裝訂:精裝
Kernel Learning Algorithms for Face Recognition covers the framework of kernel based face recognition. This book discusses the advanced kernel learning algorithms and its application on face recogniti
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Essential Algorithms ─ A Practical Approach to Computer Algorithms
滿額折
出版日:2013/07/29 作者:STEPHENS  出版社:JOHN WILEY & SONS;LTD  裝訂:平裝
A friendly and accessible introduction to the most useful algorithmsComputer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve di
優惠價: 9 2050
無庫存
Proportionate-Type Normalized Least Mean Square Algorithms
90 折
出版日:2013/07/01 作者:Wagner  出版社:John Wiley & Sons Inc  裝訂:平裝
Proportionate-type normalized least mean square (PtNLMS) algorithms are developed and analyzed. PtNLMS algorithms offer low computational complexity and fast convergence times, for sparse impulse resp
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Evolutionary Optimization Algorithms: Biologocally-Inspired And Population-Based Approaches To Computer Intelligence
90 折
出版日:2013/04/12 作者:Simon  出版社:John Wiley & Sons Inc  裝訂:平裝
This book covers the theory, history, mathematics, and applications of evolutionary optimization algorithms. Most of these algorithms are motivated by biological processes. The algorithms that are dis
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2013/03/31 作者:Renato Portugal  出版社:Springer Verlag  裝訂:精裝
This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2013/02/02 作者:Xinyuan Wu; Xiong You; Bin Wang  出版社:Springer Verlag  裝訂:精裝
Structure-Preserving Algorithms for Oscillatory Differential Equations describes a large number of highly effective and efficient structure-preserving algorithms for second-order oscillatory different
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Analyzing Evolutionary Algorithms
90 折
出版日:2012/12/19 作者:Thomas Jansen  出版社:Springer-Verlag New York Inc  裝訂:精裝
Evolutionary algorithms is a class of randomized heuristics inspired by natural evolution. They are applied in many different contexts, in particular in optimization, and analysis of such algorithms h
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Stochastic Recursive Algorithms for Optimization—Simultaneous Perturbation Methods
90 折
出版日:2012/08/12 作者:S. Bhatnagar; H. L. Prasad; L.a. Prashanth  出版社:Springer Verlag  裝訂:平裝
Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unif
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2012/02/10 作者:Ernesto Sanchez; Giovanni Squillero; Alberto Tonda  出版社:Springer-Verlag New York Inc  裝訂:精裝
"Industrial applications of evolutionary algorithms" is intended as a resource for both experienced users of evolutionary algorithms and researchers that are beginning to approach these fascinating op
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2011/11/03 作者:Fajie Li; Reinhard Klette  出版社:Springer-Verlag New York Inc  裝訂:精裝
This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing e
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2011/11/01 作者:Frank Dehne (EDT); John Iacono (EDT); Jorg-Rudiger Sack (EDT)  出版社:Springer-Verlag New York Inc  裝訂:平裝
This book constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, USA, in August 2011. The Algorithms and Data Structures Symposium
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Graph Algorithms
90 折
出版日:2011/10/31 作者:Shimon Even  出版社:Cambridge Univ Pr  裝訂:精裝
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Graph Algorithms
90 折
出版日:2011/10/31 作者:Shimon Even  出版社:Cambridge Univ Pr  裝訂:平裝
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
優惠價: 9 1696
無庫存
The Design of Approximation Algorithms
90 折
出版日:2011/04/26 作者:David P. Williamson  出版社:Cambridge Univ Pr  裝訂:精裝
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses
優惠價: 9 3275
無庫存
出版日:2010/11/04 作者:Jorg Arndt  出版社:Springer-Verlag New York Inc  裝訂:精裝
Matters ComputationalThis book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Four
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2008/11/01 作者:Sio-Iong Ao (EDT); Burghard Rieger (EDT); Su-Shing Chen (EDT)  出版社:Springer-Verlag New York Inc  裝訂:精裝
Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in the
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Parallel Algorithms
90 折
出版日:2008/08/15 作者:Henri Casanova; Armand Legrand; Yves Robert  出版社:CRC Press UK  裝訂:精裝
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2008/02/28 作者:Nalini K. Ratha (EDT); Venu Govindaraju (EDT)  出版社:Springer Verlag  裝訂:精裝
Recent advances in biometrics include new developments in sensors, modalities and algorithms. As new sensors are designed, newer challenges emerge in the algorithms for accurate recognition. Written f
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Handbook Of Applied Algorithms: Solving Scientific, Engineering And Practical Problems
90 折
出版日:2008/02/15 作者:Nayak  出版社:John Wiley & Sons Inc  裝訂:精裝
Discover the benefits of applying algorithms to solve scientific, engineering, and practical problems Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms pr
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
出版日:2007/11/28 作者:Jacques Mohcine Bahi; Sylvain Contassot-vivier; Raphael Couturier  出版社:Taylor & Francis  裝訂:精裝
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussi
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
MACHINE VISION ALGORITHMS AND APPLICATIONS
滿額折
出版日:2007/11/14 作者:STEGER  出版社:JOHN WILEY & SONS;LTD  裝訂:平裝
Machine Vision Algorithms and Applications is the first up-to-date textbook for machine vision software provides all the details on the theory and practical use of the relevant algorithms. The first
優惠價: 9 2392
無庫存
Visibility Algorithms in the Plane
90 折
出版日:2007/03/29 作者:Subir Kumar Ghosh  出版社:Cambridge Univ Pr  裝訂:精裝
A human observer can effortlessly identify visible portions of geometric objects present in the environment. However, computations of visible portions of objects from a viewpoint involving thousands of objects is a time consuming task even for high speed computers. To solve such visibility problems, efficient algorithms have been designed. This book presents some of these visibility algorithms in two dimensions. Specifically, basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths and visibility queries are all discussed. Several geometric properties are also established through lemmas and theorems. With over 300 figures and hundreds of exercises, this book is ideal for graduate students and researchers in the field of computational geometry. It will also be useful as a reference for researchers working in algorithms, robotics, computer graphics and geometric graph theory, and some algorithms from the book can be used in a first course in
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Genetic Algorithms In Electromagnetics
90 折
出版日:2007/03/27 作者:Haupt  出版社:John Wiley & Sons Inc  裝訂:精裝
A thorough and insightful introduction to using genetic algorithms to optimize electromagnetic systems Genetic Algorithms in Electromagnetics focuses on optimizing the objective function when a compu
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Data Structures and Algorithms Using C#
90 折
出版日:2007/03/26 作者:Michael McMillan  出版社:Cambridge Univ Pr  裝訂:平裝
C# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.
優惠價: 9 2164
無庫存
Data Structures and Algorithms Using C#
90 折
出版日:2007/03/26 作者:Michael McMillan  出版社:Cambridge Univ Pr  裝訂:精裝
C# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Nonlinear Programming: Theory And Algorithms, Third Edition
90 折
出版日:2006/04/20 作者:Bazaraa  出版社:John Wiley & Sons Inc  裝訂:精裝
COMPREHENSIVE COVERAGE OF NONLINEAR PROGRAMMING THEORY AND ALGORITHMS, THOROUGHLY REVISED AND EXPANDEDNonlinear Programming: Theory and Algorithms—now in an extensively updated Third EditionR
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Beginning Algorithms
滿額折
出版日:2005/10/21 作者:Harris  出版社:John Wiley & Sons Inc  裝訂:平裝
Beginning Algorithms A good understanding of algorithms, and the knowledge of when to apply them, is crucial to producing software that not only works correctly, but also performs efficiently. This i
優惠價: 9 1368
無庫存
Graphy Theory, Combinatorics And Algorithms ― Interdisciplinary Applications
90 折
出版日:2005/10/20 作者:Martin Charles Golumbic (EDT); Irith Ben-Arroyo Hartman (EDT)  出版社:Springer Verlag  裝訂:精裝
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operat
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Data Structures and Algorithms Using Visual Basic.NET
90 折
出版日:2005/03/07 作者:Michael McMillan  出版社:Cambridge Univ Pr  裝訂:平裝
This is the first Visual Basic.NET book to provide a comprehensive discussion of the major data structures and algorithms. Here, instead of having to translate material on C++ or Java, the professional or student VB.NET programmer will find a tutorial on how to use data structures and algorithms and a reference for implementation using VB.NET for data structures and algorithms from the .NET Framework Class Library as well as those which must be developed by the programmer. In an object-oriented fashion, the author presents arrays and arraylists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching as well as more advanced algorithms, such as probabilistic algorithms and dynamic programming. His approach is very practical, for example using timing tests rather than Big O analysis to compare the performance of data structures and algorithms. This book can be used in both beginning and advanced computer programming courses that use the VB.NET language and, most im
優惠價: 9 2807
無庫存
New Optimization Algorithms - In Physics And Computational Science
90 折
出版日:2004/06/11 作者:Hartmann  出版社:John Wiley & Sons Inc  裝訂:精裝
Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have n
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Algorithms in Java ― Graph Algorithms
90 折
出版日:2003/07/01 作者:Robert Sedgewick  出版社:Prentice Hall  裝訂:平裝
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of
優惠價: 9 2430
無庫存
Permutation Group Algorithms
90 折
出版日:2003/03/17 作者:Ákos Seress  出版社:Cambridge Univ Pr  裝訂:精裝
Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
  • 4510
    113
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 113

暢銷榜

客服中心

收藏

會員專區