Search Results - (((((((ant OR find) OR spanning) OR arts) OR cantor) OR anne) OR cartsr) OR tkanto) algorithms.

Swarm Intelligence Algorithms : Modifications and Applications. by Slowik, Adam

Table of Contents: “…-- 1.2.3 Pseudo-code of standard ACO algorithm -- 1.3 Modified variants of ant colony optimization -- 1.3.1 Elitist ant systems -- 1.3.2 Ant colony system -- 1.3.3 Max-min ant system -- 1.3.4 Rank based ant systems -- 1.3.5 Continuous orthogonal ant systems…”
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)

Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms : Ottawa, Canada, August 1985

Table of Contents: “…New upperbounds for decentralized extrema-finding in a ring of processors -- 4. Efficient algorithms for routing information in a multicomputer system -- 5. …”
Full text (MFA users only)

Ideals, Varieties, and Algorithms : an Introduction to Computational Algebraic Geometry and Commutative Algebra by Cox, David, Little, John, O'Shea, Donal

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)

Elimination Practice : Software Tools and Applications (With Cd-Rom). by Wang, Dongming

Full text (MFA users only)

Automatic defense against zero-day polymorphic worms in communication networks by Mohammed, Mohssen, 1982-

Full text (MFA users only)

C++ Data Structures and Algorithms : Learn how to write efficient code to build scalable and robust applications in C++. by Anggoro, Wisnu

Table of Contents: “…Chapter 4: Arranging Data Elements Using a Sorting AlgorithmTechnical requirements; Bubble sort; Selection sort; Insertion sort; Merge sort; Quick sort; Counting sort; Radix sort; Summary; QA section; Further reading; Chapter 5: Finding out an Element Using Searching Algorithms; Technical requirements; Linear search; Developing a linear search algorithm; Implementing the linear search algorithm; Binary search; Developing binary search algorithm; Implementing binary search algorithm ; Ternary search; Developing ternary search algorithm; Applying the ternary search algorithm.…”
Full text (MFA users only)

Finding the Forest in the Trees : the Challenge of Combining Diverse Environmental Data. by Staff, National Research Council

Table of Contents: “…""Finding the Forest in the Trees""; ""Copyright""; ""Preface""; ""Acknowledgments""; ""Contents""; ""Executive Summary""; ""SUMMARY OF CONCLUSIONS AND RECOMMENDATIONS""; ""Addressing Barriers Deriving from the Data""; ""Addressing Barriers Deriving from Users' Needs""; ""Addressing Barriers Deriving from Organizational Interactions""; ""Addressing Barriers Deriving from System Considerations""; ""TEN KEYS TO SUCCESS""; ""1 Introduction""; ""METHODOLOGY OF THE STUDY""; ""ORGANIZATION OF THE REPORT""; ""REFERENCES""; ""2 Impact Assessment Project for Drought Early Warning in the Sahel""…”
Full text (MFA users only)

Algorithms for image processing and computer vision by Parker, J. R. (Jim R.), 1955-

Table of Contents: “…Algorithms for Image Processing and Computer Vision; Contents; Preface; Chapter 1 Practical Aspects of a Vision System -- Image Display, Input/Output, and Library Calls; Chapter 2 Edge-Detection Techniques; Chapter 3 Digital Morphology; Chapter 4 Grey-Level Segmentation; Chapter 5 Texture and Color; Chapter 6 Thinning; Chapter 7 Image Restoration; Chapter 8 Classification; Chapter 9 Symbol Recognition; Chapter 10 Content-Based Search -- Finding Images by Example; Chapter 11 High-Performance Computing for Vision and Image Processing; Index.…”
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)

Scalable algorithms for contact problems by Dostál, Zdeněk, Kozubek, Tomáš, 1975-, Sadowská, Marie, Vonk, Vít

Full text (MFA users only)

Graph algorithms and applications 4

Table of Contents: “…Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. …”
Full text (MFA users only)

Random Iterative Models by Duflo, Marie

Full text (MFA users only)

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

Table of Contents: “…Ant colony optimization…”
Full text (MFA users only)

Polynomial root-finding and polynomiography by Kalantari, Bahman

Table of Contents: “…Approximation of square-roots and their visualizations -- The fundamental theorem of algebra and a special case of Taylor's theorem -- Introduction to the basic family and polynomiography -- Equivalent formulations of the basic family -- Basic family as dynamical system -- Fixed points of the basic family -- Algebraic derivation of the basic family and characterizations -- The truncated basic family and the case of Halley family -- Characterizations of solutions of homogeneous linear recurrence relations -- Generalization of Taylor's theorem and Newton's method -- The multipoint basic family and its order of convergence -- A computational study of the multipoint basic family -- A general determinantal lower bound -- Formulas for approximation of pi based on root-finding algorithms -- Bounds on roots of polynomials and analytic functions -- A geometric optimization and its algebraic offsprings -- Polynomiography : algorithms for visualization of polynomial equations -- Visualization of homogeneous linear recurrence relations -- Applications of polynomiography in art, education, science, and mathematics -- Approximation of square-roots revisited -- Further applications and extensions of the basic family and polynomiography.…”
Full text (MFA users only)