Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
A Beginner's Guide to Discrete Mathematics
A Beginner's Guide to Discrete Mathematics

Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline . . . Lower-division undergraduates...

The Mikado Method
The Mikado Method

Summary

The Mikado Method is a book written by the creators of this process. It describes a pragmatic, straightforward, and empirical method to plan and perform non-trivial technical improvements on an existing software system. The method has simple rules, but the applicability is vast. As you read,...

Theoretical Aspects of Computer Science: Advanced Lectures (Lecture Notes in Computer Science)
Theoretical Aspects of Computer Science: Advanced Lectures (Lecture Notes in Computer Science)
The First Summer School on Theoretical Aspects on Computer Science was held at the Institute for Studies in Theoretical Physics and Mathematics (IPM) from July 3-10, 2000.

The idea of organizing a summer school was originated during a conversation between the first and the second editor of this volume in the winter
...
Emerging Spatial Information Systems and Applications
Emerging Spatial Information Systems and Applications
Spatial information systems were created manually for many years. For example, historically, the source of cholera in London in 1854 was found by John Snow, by mapping where victims of the disease lived. The graph clearly showed them to be close to the Broad Street Pump,1 one of the city’s water wells. Another example is Zipf’s Law,2...
Discrete Mathematics for Computer Science
Discrete Mathematics for Computer Science

As the discipline of computer science has matured, it has become clear that a study of discrete mathematical topics is an essential part of the computer science major. The course in discrete structures has two primary aims. The first is to introduce students to the rich mathematical structures that naturally describe much of the content of...

WALCOM: Algorithms and Computation: 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings (Lecture Notes in Computer Science (11355))
WALCOM: Algorithms and Computation: 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings (Lecture Notes in Computer Science (11355))

This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.

The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the...

Algorithms in a Nutshell (O'Reilly)
Algorithms in a Nutshell (O'Reilly)
Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs -- with just enough math to let...
Hierarchical Voronoi Graphs: Spatial Representation and Reasoning for Mobile Robots
Hierarchical Voronoi Graphs: Spatial Representation and Reasoning for Mobile Robots

Voronoi graphs and their hierarchical extensions have become a widely used tool for deriving abstract spatial representations from environmental data. They are currently being studied and applied in several subfields of computer science such as AI and robotics, computational geometry, and geoinformatics.

This book investigates the...

Modern Compiler Implementation in C
Modern Compiler Implementation in C

This new, expanded textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes good coverage of current techniques in code...

Handbook of Graph Theory
Handbook of Graph Theory
Over tlid- past forty years, graph theory has been one of the most rapidly growing areas of mathematics. Siuee 19oO, more than 10.000 different authors have published papers classified as graph l he or у by XI nth Reviews, and for the past decade, over 1000 graph theory papers have been published each year.

litis
...
Graphs and Networks: Multilevel Modeling
Graphs and Networks: Multilevel Modeling

Completely updated and containing two new chapters, this title covers spatial analysis and urban management using graph theory simulation.  Highly practical, the simulation approach allows readers to solve classic problems such as placement of high-speed roads, the capacity of a network, pollution emission control, and more.

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

A complete guide on using data structures and algorithms to write sophisticated C# code

Key Features

  • Master array, set and map with trees and graphs, among other fundamental data structures
  • Delve into effective design and implementation techniques to meet your software...
unlimited object storage image
Result Page: 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 
©2021 LearnIT (support@pdfchm.net) - Privacy Policy