1.
|
図書
|
Alexandru Dimca
出版情報: |
Cham : Springer, c2017 xii, 200 p. ; 24 cm |
シリーズ名: |
Universitext |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
2.
|
図書
|
Heinz H. Bauschke, Regina S. Burachik, D. Russell Luke, editors
出版情報: |
Cham : Springer, c2019 xix, 489 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
3.
|
図書
|
Andrei N. Kolmogorov ; editer, Albert N. Shiryaev
|
4.
|
図書
|
Anany Levitin and Maria Levitin
出版情報: |
New York : Oxford University Press, c2011 xxi, 257 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Preface |
Acknowledgments |
List of Puzzles |
Tutorial Puzzles |
Main Section Puzzles |
The Epigraph Puzzle: Who said what? |
Tutorials / 1: |
General Strategies for Algorithm Design |
Analysis Techniques |
Puzzles / 2: |
Easier Puzzles (#1 to #50) |
Puzzles of Medium Difficulty (#51 to #110) |
Harder Puzzles (#111 to #150) |
Hints / 3: |
Solutions / 4: |
References |
Design Strategy and Analysis Index |
Index of Terms and Names |
Preface |
Acknowledgments |
List of Puzzles |
|
5.
|
図書
|
Richard Bellman, Kenneth L. Cooke, Jo Ann Lockett
|
6.
|
図書
|
Leon Bernstein
|
7.
|
図書
|
Michael Machtey, Paul Young
|
8.
|
図書
|
Albert Nijenhuis and Herbert S. Wilf
|
9.
|
図書
|
André Thayse
|
10.
|
図書
|
edited by J.C. Mason and M.G. Cox
目次情報:
続きを見る
Development of Algorithms / Part 1: |
Spline Approximation and Smoothing / 1: |
Spline Interpolation and Shape Preservation / 2: |
Multivariate Interpolation / 3: |
Least Square Methods / 4: |
Rational Approximation / 5: |
Complex and Nonlinear Approximation / 6: |
Computer-Aided Design and Blending / 7: |
Applications / Part 2: |
Applications in Numerical Analysis / 8: |
Applications in Partial Differential Equations / 9: |
Applications in Other Disciplines / 10: |
Software / Part 3: |
Development of Algorithms / Part 1: |
Spline Approximation and Smoothing / 1: |
Spline Interpolation and Shape Preservation / 2: |
|
11.
|
図書
|
M.N.S. Swamy, K. Thulasiraman
|
12.
|
図書
|
J. R. Cash
|
13.
|
図書
|
G.M. Adelson-Velsky, V.L. Arlazarov, M.V. Donskoy ; [translator, Arthur Brown]
出版情報: |
New York ; Berlin ; Tokyo : Springer, c1988 x, 197 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
14.
|
図書
|
John A.N. Lee
出版情報: |
New York : Van Nostrand Reinhold, c1972 xvi, 397 p. ; 24 cm |
シリーズ名: |
Computer science series |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
15.
|
図書
|
edited by H.J.J. te Riele, Th.J. Dekker, H.A. van der Vorst
|
16.
|
図書
|
[by] Anthony V. Fiacco [and] Garth P. McCormick
出版情報: |
New York : Wiley, c1968 xiv, 210 p. ; 23 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
17.
|
図書
|
S.E. Goodman, S.T. Hedetniemi
|
18.
|
図書
|
Niklaus Wirth
|
19.
|
図書
|
Albert Nijenhuis and Herbert S. Wilf
|
20.
|
図書
|
Lydia Kronsjö
出版情報: |
Chichester ; New York : Wiley, c1987 xiii, 363 p. ; 24 cm |
シリーズ名: |
Wiley series in computing |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
21.
|
図書
|
edited by Leah H. Jamieson, Dennis Gannon, Robert J. Douglass
|
22.
|
図書
|
Samuel D. Stearns, Ruth A. David
|
23.
|
図書
|
Edward G. Coffman, Jr., Peter J. Denning
|
24.
|
図書
|
Hans Hermes ; translated by G.T. Hermann and O. Plassmann
|
25.
|
図書
|
Gregory M. Nielson, Hans Hagen, Heinrich Müller
出版情報: |
Los Alamitos, Calif. : IEEE Computer Society Press, 1997 xiii, 577 p. ; 26 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
26.
|
図書
|
Marc van Kreveld ... [et al.] (eds.)
|
27.
|
図書
|
Elijah Polak
|
28.
|
図書
|
Victor A. Brumberg
出版情報: |
Berlin ; New York : Springer-Verlag, c1995 viii, 236 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
29.
|
図書
|
Marcel F. Neuts
出版情報: |
London ; New York : Chapman & Hall, 1995 xii, 465 p. ; 24 cm |
シリーズ名: |
Stochastic modeling |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Preface |
Computational Probability: An Introduction |
Solving Equations |
Functions of Random Variables |
Discrete-Time Markov Chains |
Continuous-Time Markov Chains |
Experimentation and Visualization |
References |
Some Topics from Matrix Analysis / Appendix 1: |
Phase-Type Distibutions / Appendix 2: |
The Markovian Arrival Process / Appendix 3: |
Solution to Selected Problems |
Index |
Preface |
Computational Probability: An Introduction |
Solving Equations |
|
30.
|
図書
|
Rajeev Motwani, Prabhakar Raghavan
出版情報: |
Cambridge ; New York, N.Y. : Cambridge University Press, 1995 xiv, 476 p. ; 26 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Tools and Techniques / Part I: |
Introduction / 1: |
Game-theoretic techniques / 2: |
Moments and deviations / 3: |
Tail inequalities / 4: |
The probabilistic method / 5: |
Markov chains and random walks / 6: |
Algebraic techniques / 7: |
Applications / Part II: |
Data structures / 8: |
Geometric algorithms and linear programming / 9: |
Graph algorithms / 10: |
Approximate counting / 11: |
Parallel and distributed algorithms / 12: |
Online algorithms / 13: |
Number theory and algebra / 14: |
Notational index / Appendix A: |
Mathematical background / Appendix B: |
Basic probability theory / Appendix C: |
Tools and Techniques / Part I: |
Introduction / 1: |
Game-theoretic techniques / 2: |
|
31.
|
図書
|
Guri I. Marchuk, Valeri I. Agoshkov, Victor P. Shutyaev
出版情報: |
Boca Raton, Fla. : CRC Press, c1996 275 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Principles of Construction of Adjoint Operators in Non-Linear Problems |
Properties of Adjoint Operators Constructed on the Basis of Various Principles |
Solvability of Main and Adjoint Equations in Non-Linear Problems |
Transformation Groups, Conservation Laws and Construction of the Adjoint Operators in Non-Linear Problems |
Perturbation Algorithms in Non-Linear Problems |
Adjoint Equations and the N-th Order Perturbation Algorithms in Non-Linear Problems of Transport Theory |
Adjoint and |
Principles of Construction of Adjoint Operators in Non-Linear Problems |
Properties of Adjoint Operators Constructed on the Basis of Various Principles |
Solvability of Main and Adjoint Equations in Non-Linear Problems |
|
32.
|
図書
|
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
|
33.
|
図書
|
Varol Akman
|
34.
|
図書
|
Sara Baase
|
35.
|
図書
|
Herbert S. Wilf
出版情報: |
Englewood Cliffs, N.J. : Prentice-Hall, c1986 vi, 231 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Preface |
Preface to the Second Edition |
What this Book Is About / 0: |
Background / 0.1: |
Hard versus Easy Problems / 0.2: |
A Preview / 0.3: |
Mathematical Preliminaries / 1: |
Orders of Magnitude / 1.1: |
Positional Number Systems / 1.2: |
Manipulations with Series / 1.3: |
Recurrence Relations / 1.4: |
Counting / 1.5: |
Graphs / 1.6: |
Recursive Algorithms / 2: |
Introduction / 2.1: |
Quicksort / 2.2: |
Recursive Graph Algorithms / 2.3: |
Fast Matrix Multiplication / 2.4: |
The Discrete Fourier Transform / 2.5: |
Applications of the FFT / 2.6: |
A Review / 2.7: |
Bibliography / 2.8: |
The Network Flow Problem / 3: |
Algorithms for the Network Flow Problem / 3.1: |
The Algorithm of Ford and Fulkerson / 3.3: |
The Max-Flow Min-Cut Theorem / 3.4: |
The Complexity of the Ford-Fulkerson Algorithm / 3.5: |
Layered Networks / 3.6: |
The MPM Algorithm / 3.7: |
Applications of Network Flow / 3.8: |
Algorithms in the Theory of Numbers / 4: |
Preliminaries / 4.1: |
The Greatest Common Divisor / 4.2: |
The Extended Euclidean Algorithm / 4.3: |
Primality Testing / 4.4: |
Interlude: The Ring of Integers Modulo n / 4.5: |
Pseudoprimality Tests / 4.6: |
Proof of Goodness of the Strong Pseudoprimality Test / 4.7: |
Factoring and Cryptography / 4.8: |
Factoring Large Integers / 4.9: |
Proving Primality / 4.10: |
NP-Completeness / 5: |
Turing Machines / 5.1: |
Cook's Theorem / 5.3: |
Some Other NP-Complete Problems / 5.4: |
Half a Loaf ... / 5.5: |
Backtracking (I): Independent Sets / 5.6: |
Backtracking (II): Graph Coloring / 5.7: |
Approximate Algorithms for Hard Problems / 5.8: |
Hints and Solutions for Selected Problems |
Index |
Preface |
Preface to the Second Edition |
What this Book Is About / 0: |
|
36.
|
図書
|
T.C. Hu
出版情報: |
Reading, MA : Addison-Wesley Pub. Co., c1982 292 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Shortest Paths / Chapter 1: |
Graph terminology / 1.1: |
Shortest path / 1.2: |
Multiterminal shortest paths / 1.3: |
Decomposition algorithm / 1.4: |
Acyclic network / 1.5: |
Shortest paths in a general network / 1.6: |
Minimum spanning tree / 1.7: |
Breadth-first-search and depth-first-search / 1.8: |
Maximum flows / Chapter 2: |
Maximum flow / 2.1: |
Algorithms for max flows / 2.2: |
Ford and Fulkerson / 2.2.1: |
Karzanov's algorithm / 2.2.2: |
MPM algorithms / 2.2.3: |
Analysis of algorithms / 2.2.4: |
Multi-terminal maximum flows / 2.3: |
Realization / 2.3.1: |
Analysis / 2.3.2: |
Synthesis / 2.3.3: |
Multi-commodity flows / 2.3.4: |
Minimum cost flows / 2.4: |
Applications / 2.5: |
Sets of distinct representatives / 2.5.1: |
PERT / 2.5.2: |
Optimum communication spanning tree / 2.5.3: |
Dynamic programming / Chapter 3: |
Introduction / 3.1: |
Knapsack problem / 3.2: |
Two-dimensional knapsack problem / 3.3: |
Minimum-cost alphabetic tree / 3.4: |
Summary / 3.5: |
Backtracking / Chapter 4: |
Estimating the efficiency of backtracking / 4.1: |
Branch and bound / 4.3: |
Game-tree / 4.4: |
Binary tree / Chapter 5: |
Huffman's tree / 5.1: |
Alphabetic tree / 5.3: |
Hu-Tucker algorithm / 5.4: |
Feasibility and optimality / 5.5: |
Garsia and Wachs' algorithm / 5.6: |
Regular cost function / 5.7: |
T-ary tree and other results / 5.8: |
Heuristic and near optimum / Chapter 6: |
Greedy algorithm / 6.1: |
Bin-packing / 6.2: |
Job-scheduling / 6.3: |
Job-scheduling (tree-constraints) / 6.4: |
Matrix multiplication / Chapter 7: |
Strassen's matrix multiplication / 7.1: |
Optimum order of multiplying matrices / 7.2: |
Partitioning a convex polygon / 7.3: |
The heuristic algorithm / 7.4: |
NP-complete / Chapter 8: |
Polynomial algorithms / 8.1: |
Nondeterministic algorithms / 8.3: |
NP-complete problems / 8.4: |
Facing a new problem / 8.5: |
Local indexing algorithms / Chapter 9: |
Mergers of algorithms / 9.1: |
Maximum flows and minimum cuts / 9.2: |
Maximum adjacency and minimum separation / 9.3: |
Gomory-Hu tree / Chapter 10: |
Tree edges and tree links / 10.1: |
Contraction / 10.2: |
Domination / 10.3: |
Equivalent formulations / 10.4: |
Optimum mergers of companies / 10.4.1: |
Optimum circle partition / 10.4.2: |
Extreme stars and host-feasible circles / 10.5: |
The high-level approach / 10.6: |
Chop-stick method / 10.7: |
Relationship between phases / 10.8: |
The staircase diagram / 10.9: |
Complexity issues / 10.10: |
Comments on Chapters 2, 5 & 6 / Appendix A: |
Ancestor trees / A.1: |
Minimum surface or plateau problem / A.2: |
Comments on binary trees in chapter 5 / A.3: |
A simple proof of the Hu-Tucker algorithm / A.3.1: |
Binary search trees / A.3.2: |
Binary search on a tape / A.3.3: |
Comments on §6.2, bin-packing / A.4: |
Network algebra / Appendix B: |
Shortest Paths / Chapter 1: |
Graph terminology / 1.1: |
Shortest path / 1.2: |
|
37.
|
図書
|
Robert Sedgewick
|
38.
|
図書
|
Vinod Chachra, Prabhakar M. Ghare, James M. Moore
出版情報: |
New York : North-Holland-New York, c1979 ix, 421 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
39.
|
図書
|
by John P. Fishburn
|
40.
|
図書
|
edited by Gregory J.E. Rawlins
出版情報: |
San Mateo, Calif. : Morgan Kaufmann Publishers, c1991- v. ; 22-24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
目次情報:
続きを見る
Introduction / Wolfgang Banzhaf ; Colin Reeves |
On the Dynamics of EAs without Selection / Hans-Georg Beyer |
Candidate Longpaths for the Simple Genetic Algorithm / Leila Kallel ; Bart Naudts |
On the Limit of Long Strings / Adam Prugel-Bennett |
Modelling the Dynamics of a Steady State Genetic Algorithm / Alex Rogers |
Population Fixed-Points for Functions of Unitation / Jonathan E. Rowe |
Dining with GAs: Operator Lunch Theorems / William M. Spears ; Kenneth A. De Jong |
Putting the "Genetics" Back into Genetic Algorithms (Reconsidering the Role of Crossover in Hybrid Operators) / Stephen Chen ; Stephen F. Smith |
Schemata as Building Blocks: Does Size Matter? / C. R. Stephens ; H. Waelbroeck ; R. Aguirre |
A Formal Language for Permutation Recombination Operators / Michael Vose ; Darrell Whitley |
Locality vs. Randomness--Dependence of Operator Quality on the Search State / Karsten Weicker ; Nicole Weicker |
An Examination of Tunable, Random Search Landscapes / R. E. Smith ; J. E. Smith |
Test Function Generators as Embedded Landscapes / Robert B. Heckendorn ; Soraya Rana |
Genetic Algorithms, Fitness Sublandscapes and Subpopulations / Vanio Slavov ; Nikolay Nikolaev |
Replacement Strategies in Steady State Genetic Algorithms: Static Environments / Jim Smith ; Frank Vavak |
The Effect of Incest Prevention on Genetic Drift / J. David Schaffer ; Murali Mani ; Larry Eshelman ; Keith Mathias |
Recombination and Error Thresholds in Finite Populations / Gabriela Ochoa ; Inman Harvey |
Understanding Interactions among Genetic Algorithm Parameters / Kalyanmoy Deb ; Samir Agrawal |
Toward a Control Map for Niching / Jeffrey Horn ; David E. Goldberg |
Author Index |
Key Word Index |
Introduction / Wolfgang Banzhaf ; Colin Reeves |
On the Dynamics of EAs without Selection / Hans-Georg Beyer |
Candidate Longpaths for the Simple Genetic Algorithm / Leila Kallel ; Bart Naudts |
|
41.
|
図書
|
D.E. Knuth
|
42.
|
図書
|
N.B. Karayiannis, A.N. Venetsanopoulos
|
43.
|
図書
|
by Robert A. Paige
|
44.
|
図書
|
G. Butler
|
45.
|
図書
|
Yuval Davidor
|
46.
|
図書
|
edited by Lawrence Davis
出版情報: |
New York : Van Nostrand Reinhold, c1991 xii, 385 p. ; 24 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
47.
|
図書
|
Luděk Kučera
出版情報: |
Bristol ; Philadelphia : Adam Hilger, c1990 xi, 270 p. ; 25 cm |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
48.
|
図書
|
[by] J.F. Traub
|
49.
|
図書
|
edited by M.A. Gavrilov and A.D. Zakrevskii ; translated by Morton Nadler
出版情報: |
New York : Academic Press, 1969 xix, 475 p. ; 24 cm |
シリーズ名: |
ACM monograph series |
子書誌情報: |
loading… |
所蔵情報: |
loading… |
|
50.
|
図書
|
Peter H. Sellers
|