Search Results - (((((((kant OR wwanting) OR span) OR wantsa) OR cantor) OR anne) OR warter) OR fanting) algorithms.

Theory of randomized search heuristics : foundations and recent developments

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)

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 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)

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)

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)

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

Full text (MFA users only)

The Biostatistics of Aging : From Gompertzian Mortality to an Index of Aging-Relatedness. by Levy, Gilberto

Full text (MFA users only)

Turing's vision : the birth of computer science by Bernhardt, Chris

Full text (MFA users only)

Adventures in Raspberry Pi by Philbin, Carrie Anne

Full text (MFA users only)

Machine Learning and Big Data Concepts, Algorithms, Tools and Applications by Dulhare, Uma N., Ahmad, Khaleel, Bin Ahmad, Khairol Amali

Full text (MFA users only)

Intelligence emerging : adaptivity and search in evolving neural systems by Downing, Keith L.

Full text (MFA users only)

Evaluation and management for infectious diseases and dermatologic disorders

Full text (MFA users only)

The AI book : the artificial intelligence handbook for investors, entrepreneurs and FinTech visionaries

Full text (MFA users only)

Tolerance graphs by Golumbic, Martin Charles

Full text (MFA users only)

Pediatric Sensorineural Hearing Loss : Clinical Diagnosis and Management. by Anne, Samantha

Full text (MFA users only)

Deterministic Network Calculus. by Bouillard, Anne

Full text (MFA users only)