Search Results - (((((((kant OR wint) OR spanning) OR art) OR cantor) OR anne) OR carter) OR santis) algorithms.

Theory of randomized search heuristics : foundations and recent developments

Full text (MFA users only)

Flowchart and Algorithm Basics : The Art of Programming. by Chaudhuri, A. B.

Full text (MFA users only)

How to guard an art gallery and other discrete mathematical adventures by Michael, T. S., 1960-

Table of Contents: “…s Formula: Second Proof -- 2.8 Batting Averages and Lattice Points -- 2.9 Three Dimensions and N-largements -- 2.10 Notes and References -- 2.11 Problems -- 3 How to Guard an Art Gallery -- 3.1 The Sunflower Art Gallery -- 3.2 Art Gallery Problems -- 3.3 The Art Gallery Theorem -- 3.4 Colorful Consequences -- 3.5 Triangular and Chromatic Assumptions -- 3.6 Modern Art Galleries -- 3.7 Art Gallery Sketches -- 3.8 Right-Angled Art Galleries -- 3.9 Guarding the Guards -- 3.10 Three Dimensions and the Octoplex…”
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)

The Human Algorithm by Solis, Brian

Full text (MFA users only)

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

Full text (MFA users only)

Open Data Structures : an Introduction. by Morin, Pat

Full text (MFA users only)

Introduction to cryptography by Padhye, Sahadeo, Sahu, Rajeev A., Saraswat, Vishal

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)

Structural geology algorithms : vectors and tensors by Allmendinger, Richard Waldron, Cardozo, Nestor, Fisher, Donald M., 1961-

Full text (MFA users only)

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

Full text (MFA users only)

Ensemble methods : foundations and algorithms. by Zhou, Zhi-Hua (Computer scientist)

Full text (MFA users only)

Genome Sequencing Technology and Algorithms. by Kim, Sun

Full text (MFA users only)

Graph algorithms and applications 3

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)

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)

Metaheuristic optimization for the design of automatic control laws by Sandou, Guillaume

Table of Contents: “…Identification problematic and brief state of the art 2.2. Problem statement and modeling -- 2.2.1. …”
Full text (MFA users only)

Nearest-neighbor methods in learning and vision : theory and practice

Full text (MFA users only)

Algorithms, architectures and information systems security

Table of Contents: “…Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains S.-W. Cheng, T.K. …”
Full text (MFA users only)