Algorithms

Approximation Algorithms and Semidefinite Programming

90 折

241.

Approximation Algorithms and Semidefinite Programming

出版日：2012/01/10 作者：Bernd Gartner; Jiri Matousek 出版社：Springer Verlag 裝訂：精裝

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of r

優惠價： 9 3150

無庫存

242.

Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms

出版日：2011/12/13 作者：Gene H. Golub (EDT); Paul Van Dooren (EDT) 出版社：Springer-Verlag New York Inc 裝訂：平裝

Numerical linear algebra, digital signal processing, and parallel algorithms are three disciplines with a great deal of activity in the last few years. The interaction between them has been growing to

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

243.

Euclidean Shortest Paths ─ Exact or Approximate Algorithms

出版日：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]。

244.

Computational Optimization, Methods and Algorithms

出版日：2011/06/24 作者：Slawomir Koziel (EDT); Xin-she Yang (EDT) 出版社：Springer-Verlag New York Inc 裝訂：精裝

Computational optimization is an important paradigm with a wide range of applications. In virtually all branches of engineering and industry, we almost always try to optimize something - whether to mi

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

245.

Monte Carlo ― Concepts, Algorithms, and Applications

出版日：2011/05/26 作者：George Fishman 出版社：Springer Verlag 裝訂：平裝

Apart from a thorough exploration of all the important concepts, this volume includes over 75 algorithms, ready for putting into practice. The book also contains numerous hands-on implementations of s

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

246.

Link Mining ─ Models, Algorithms, and Applications

出版日：2010/09/30 作者：Philip S. Yu (EDT); Jiawei Han (EDT); Christos Faloutsos (EDT) 出版社：Springer Verlag 裝訂：平裝

This book presents in-depth surveys and systematic discussions on models, algorithms and applications for link mining. Link mining is an important field of data mining. Traditional data mining focuses

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

247.

Algorithms and Theory of Computation Handbook

出版日：2009/12/02 作者：Mikhail J. Atallah (EDT); Marina Blanton (EDT) 出版社：Chapman & Hall 裝訂：精裝

Algorithms and Theory of Computation Handbook, Second Edition provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

248.

Applied Algorithms for Bioinformatics Problems

出版日：2009/10/30 作者：Vishal Thapar 出版社：Lightning Source Inc 裝訂：平裝

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

249.

Computer Arithmetic ─ Algorithms and Hardware Designs

出版日：2009/10/28 作者：Behrooz Parhami 出版社：Oxford Univ Press USA 裝訂：精裝

Ideal for graduate and senior undergraduate courses in computer arithmetic and advanced digital design, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, provides a balanced, compr

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

250.

Damage Models and Algorithms for Assessment of Structures Under Operation Conditions: Damage Models and Algorithms

出版日：2009/09/17 作者：Siu-seong Law (EDT); Xin-qun Zhu (EDT) 出版社：CRC Press UK 裝訂：精裝

Extensive amounts of operational data are generated over time by the health monitoring system of a structure’s management system, yet there are few analysis algorithms which can tell the exact w

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

251.

Robust Algebraic Multilevel Methods and Algorithms

出版日：2009/09/15 出版社：De Gruyter 裝訂：精裝

This book deals with algorithms for the solution of linear systems of algebraic equations with large-scale sparse matrices, with a focus on problems that are obtained after discretization of partial d

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

Efficient Algorithms for Listing Combinatorial Structures

90 折

252.

Efficient Algorithms for Listing Combinatorial Structures

出版日：2009/07/30 作者：Leslie Ann Goldberg 出版社：Cambridge Univ Pr 裝訂：平裝

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.

優惠價： 9 1754

無庫存

253.

The Top Ten Algorithms in Data Mining

出版日：2009/04/03 作者：Xindong Wu (EDT); Vipin Kumar (EDT) 出版社：Chapman & Hall 裝訂：精裝

Identifying some of the most influential algorithms that are widely used in the data mining community, The Top Ten Algorithms in Data Mining provides a description of each algorithm, discusses its imp

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

254.

Data Structures and Algorithms Using Java

出版日：2008/12/17 作者：William Mcallister 出版社：Jones & Bartlett Learning 裝訂：平裝

Designed to comply with the syllabus guidelines presented by the association of Computing Machinery, the textbook gives students taking the CS103 Data Structures and Algorithms course plenty of code e

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

255.

Conjugate Gradient Algorithms in Nonconvex Optimization

出版日：2008/12/01 作者：Radoslaw Pytlak 出版社：Springer Verlag 裝訂：精裝

This up-to-date book is on algorithms for large-scale unconstrained and bound constrained optimization. Optimization techniques are shown from a conjugate gradient algorithm perspective. Large part of

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

256.

Advances in Computational Algorithms and Data Analysis

出版日：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]。

257.

Advances in Biometrics ― Sensors, Algorithms and Systems

出版日：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]。

Mathematics for the Analysis of Algorithms

90 折

258.

Mathematics for the Analysis of Algorithms

出版日：2007/10/05 作者：Daniel H. Greene; Donald E. Knuth 出版社：Springer Verlag 裝訂：平裝

This monograph collects fundamental mathematical techniques required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present majo

優惠價： 9 2475

無庫存

259.

Handbook of Approximation Algorithms and Metaheuristics

出版日：2007/05/09 作者：Teofilo F. Gonzalez (EDT) 出版社：Chapman & Hall 裝訂：精裝

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is th

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

ALGORITHMS AND NETWORKING FOR COMPUTER GAMES

滿額折

260.

ALGORITHMS AND NETWORKING FOR COMPUTER GAMES

出版日：2006/04/21 作者：SMED 出版社：JOHN WILEY & SONS;LTD 裝訂：精裝

Algorithms and Networking for Computer Games is an essential guide to solving the algorithmic and networking problems of modern commercial computer games, written from the perspective of a computer sc

優惠價： 9 3591

無庫存

261.

Nonlinear Programming: Theory And Algorithms, Third Edition

出版日：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]。

262.

Biologically Inspired Algorithms for Financial Modelling

出版日：2006/03/30 作者：Anthony Brabazon; Michael O'Neill 出版社：Springer-Verlag New York Inc 裝訂：精裝

Predicting the future for financial gain is a difficult, sometimes profitable activity. The focus of this book is the application of biologically inspired algorithms (BIAs) to financial modelling.In a

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

263.

Graphy Theory, Combinatorics And Algorithms ― Interdisciplinary Applications

出版日：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 折

264.

Data Structures and Algorithms Using Visual Basic.NET

出版日：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

無庫存

265.

Designing Evolutionary Algorithms For Dynamic Environments

出版日：2004/08/30 作者：Ronald W. Morrison 出版社：Springer Verlag 裝訂：精裝

The robust capability of Evolutionary Algorithms (EAs) to find solutions to difficult problems has permitted them to become the optimization and search techniques of choice for many practical static p

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

266.

Algorithms for Memory Hierarchies—Advanced Lectures

出版日：2003/08/01 作者：Ulrich Meyer; Peter Sanders (EDT); Jop Sibeyn (EDT); Ulrich Meyer (EDT); Peter Sanders; Jop Sibeyn 出版社：Springer Verlag 裝訂：平裝

Algorithms that have to process large data sets have to take into account that the cost of memory access depends on where the data is stored. Traditional algorithm design is based on the von Neumann m

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

267.

Multi-Objective Optimization Using Evolutionary Algorithms

出版日：2001/05/22 作者：Deb 出版社：John Wiley & Sons Inc 裝訂：精裝

Evolutionary algorithms are relatively new, but very powerful techniques used to find solutions to many real-world search and optimization problems. Many of these problems have multiple objectives, wh

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

268.

Evolutionary Algorithms In Engineering & Computer Science

出版日：1999/04/27 作者：Miettinen 出版社：John Wiley & Sons Inc 裝訂：平裝

Evolutionary Algorithms in Engineering and Computer Science Edited by K. Miettinen, University of Jyv?skyl?, Finland M. M. M?kel?, University of Jyv?skyl?, Finland P. Neittaanm?ki, University of Jyv?s

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

269.

Combinatorial Algorithms ─ Generation, Enumeration, and Search

出版日：1998/12/01 作者：Donald L. Kreher; Douglas R. Stinson 出版社：Taylor & Francis 裝訂：精裝

An introduction to the most important combinatorial algorithmic techniques. Provides coverage of classical areas in the discipline as well as new research topics such as group algorithms, graph isomo

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

270.

Optimal Control ― Theory, Algorithms, and Applications

出版日：1998/06/01 作者：William W. Hager; Panos M. Pardalos 出版社：Springer Verlag 裝訂：精裝

The 21 papers consider theory, algorithms, and applications in a wide range of fields including aerospace design, operating hydroelectric power stations, and chemical engineering. The topics include u

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

271.

Interior Point Algorithms: Theory And Analysis

出版日：1997/08/11 作者：Ye 出版社：John Wiley & Sons Inc 裝訂：精裝

The first comprehensive review of the theory and practice of one of today's most powerful optimization techniques.The explosive growth of research into and development of interior point algorithms ove

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

272.

Efficient Algorithms for Listing Combinatorial Structures

出版日：1993/04/22 作者：Leslie Ann Goldberg 出版社：Cambridge Univ Pr 裝訂：精裝

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.

若需訂購本書，請電洽客服 02-25006600[分機130、131]。

273.

Network Flows ─ Theory, Algorithms, and Applications

出版日：1993/01/01 作者：Ravindra K. Ahuja; T. L. Magnanti; James B. Orlin 出版社：Prentice Hall 裝訂：平裝

Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications.

若需訂購本書，請電洽客服 02-25006600[分機130、131]。