Search Results - (((((((want OR wants) OR span) OR anterior) OR cantor) OR anne) OR halted) OR hints) algorithms.

Theory of randomized search heuristics : foundations and recent developments

Full text (MFA users only)

Algorithmic Puzzles. by Levitin, Anany, Levitin, Maria

Table of Contents: “…-- General strategies for algorithm design -- Analysis techniques -- Easier puzzles (#1 to #50) -- Puzzles of medium difficulty (#51 to #110) -- Harder puzzles (#111 to #150) -- Hints -- Solutions -- References -- Design stragety and analysis index.…”
Full text (MFA users only)

Probability and Algorithms. by Staff, National Research Council

Table of Contents: “…""PROBABILITY AND ALGORITHMS""; ""Copyright""; ""Preface""; ""Contents""; ""1. …”
Full text (MFA users only)

Algorithmic composition : a guide to composing music with Nyquist by Simoni, Mary Hope

Full text (MFA users only)

Permutation Group Algorithms by Seress, kos

Full text (MFA users only)

Nature-inspired optimization algorithms by Yang, Xin-She

Full text (MFA users only)

Algorithms in invariant theory by Sturmfels, Bernd, 1962-

Full text (MFA users only)

Pathway modeling and algorithm research

Table of Contents: “…PATHWAY MODELING AND ALGORITHM RESEARCH; PATHWAY MODELING AND ALGORITHM RESEARCH; Contents; Preface; Biological Pathways and Their Modeling; Abstract; 1. …”
Full text (MFA users only)

An Introduction to Algorithmic Trading : Basic to Advanced Strategies. by Leshik, Edward, Cralle, Jane

Table of Contents: “…Introduction to trading algorithms. History ; All about trading algorithms you ever wanted to know ... ; Algos defined and explained ; Who uses and provides algos ; Why have they become mainstream so quickly? …”
Full text (MFA users only)

An introduction to the analysis of algorithms by Soltys, Michael, 1971-

Table of Contents: “…Notes -- 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. …”
Full text (MFA users only)

Security of block ciphers : from algorithm design to hardware implementation by Sakiyama, Kazuo, 1971-

Full text (MFA users only)

Pattern Recognition. by Theodoridis, Sergios

Table of Contents: “…Chapter 13 Clustering Algorithms II: Hierarchical AlgorithmsChapter 14 Clustering Algorithms III: Schemes Based on Function Optimization; Chapter 15 Clustering Algorithms IV; Chapter 16 Cluster Validity; Appendix A Hints from Probability and Statistics; Appendix B Linear Algebra Basics; Appendix C Cost Function Optimization; Appendix D Basic Definitions from Linear Systems Theory; Index.…”
Full text (MFA users only)

C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. by Jamro, Marcin

Table of Contents: “…InsertionRemoval; Example -- BST visualization; AVL trees; Implementation; Example -- keep the tree balanced; Red-black trees; Implementation; Example -- RBT-related features; Binary heaps; Implementation; Example -- heap sort; Binomial heaps; Fibonacci heaps; Summary; Chapter 6: Exploring Graphs; Concept of graphs; Applications; Representation; Adjacency list; Adjacency matrix; Implementation; Node; Edge; Graph; Example -- undirected and unweighted edges; Example -- directed and weighted edges; Traversal; Depth-first search; Breadth-first search; Minimum spanning tree; Kruskal's algorithm.…”
Full text (MFA users only)

Graph algorithms and applications 3

Full text (MFA users only)

Optimization of Computer Networks : Modeling and Algorithms: a Hands-On Approach. by Pavón Mariño, Pablo

Table of Contents: “…7.1 Introduction -- 7.2 Node Location Problems -- 7.3 Full Topology Design Problems -- 7.4 Multilayer Network Design -- 7.5 Notes and Sources -- 7.6 Exercises -- References -- Part Two: Algorithms -- Chapter 8: Gradient Algorithms in Network Design -- 8.1 Introduction -- 8.2 Convergence Rates -- 8.3 Projected Gradient Methods -- 8.4 Asynchronous and Distributed Algorithm Implementations -- 8.5 Non-Smooth Functions -- 8.6 Stochastic Gradient Methods -- 8.7 Stopping Criteria -- 8.8 Algorithm Design Hints -- 8.9 Notes and Sources -- 8.10 Exercises -- References…”
Full text (MFA users only)

Network Routing : Algorithms, Protocols, and Architectures. by Medhi, Deep

Table of Contents: “…2.7.2 Distance Vector-Based Approach2.8 Shortest Widest Path and Widest Shortest Path; 2.9 Tree, Spanning Tree, and Steiner Tree Algorithms; 2.9.1 Spanning Tree: Breadth First Search and Depth First Search; 2.9.2 Minimum Spanning Tree; 2.9.3 Steiner Tree; 2.10 k-Shortest Paths Algorithm; 2.11 Summary; Further Lookup; Exercises; 3 Routing Protocols: Framework and Principles; 3.1 Routing Protocol, Routing Algorithm, and Routing Table; 3.2 Routing Information Representation and Protocol Messages; 3.3 Distance Vector Routing Protocol; 3.3.1 Conceptual Framework and Illustration.…”
Full text (MFA users only)

Introduction to programming : learn to program in Java with data structures, algorithms, and logic by Samoylov, Nick

Full text (MFA users only)

Building winning algorithmic trading systems : a trader's journey from data mining to Monte Carlo simulation to live trading by Davey, Kevin J., 1966-

Full text (MFA users only)

Network and discrete location : models, algorithms, and applications by Daskin, Mark S., 1952-

Full text (MFA users only)

Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript by Groner, Loiane

Full text (MFA users only)