|
This book consists of six units of study (Boolean Functions and Computer Arithmetic; Logic; Number Theory and Cryptography; Sets and Functions; Equivalence and Order; and Induction, Sequences and Series), each divided into two sections. Each section contains a representative selection of problems. These vary from basic to more difficult, including proofs for study by mathematics students or honors students.
http://www.math.ucsd.edu/~ebender/DiscreteText1/in
created by freebooksandarticles on 2008-07-07 04:55:16
|
|
This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in many disciplines such as computer science, engineering, business, and the sciences
http://syssci.atu.edu/math/faculty/finan/main2.pdf
created by freebooksandarticles on 2008-07-07 04:48:01
|
|
These notes are intended to be a summary of the main ideas in course CS 310: Mathematical Foundations of Computer Science which covers fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science. Topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata: deterministic algorithms, randomized algorithms, and analysis techniques based on counting methods and recurrence equations; trees and more general graphs.
http://www.math.northwestern.edu/~mlerma/papers/di
created by freebooksandarticles on 2008-07-07 04:46:21
|
|
This book consists of four units of study (Counting and Listing -- CL; Functions -- Fn; Decision Trees and Recursion -- DT; and Basic Concepts of Graph Theory -- GT), each divided into four sections. Each section contains a representative selection of problems. These vary from basic to more difficult, including proofs for study by mathematics students or honors students. The first three sections in units CL and Fn are primarily a review of material in A Short Course in Discrete Mathematics needed for this course.
http://www.math.ucsd.edu/~ebender/DiscreteText2/in
created by freebooksandarticles on 2008-07-07 04:47:07
|
|
This book is about generating functions and some of their uses in discrete mathematics. The subject is so vast that there is no attempt to give a comprehensive discussion. Instead this book tries only to communicate some of the main ideas.
http://www.math.upenn.edu/~wilf/DownldGF.html
created by freebooksandarticles on 2008-07-07 04:49:55
|
|
Combinatorics is too big a subject to be done justice in a single text. The selection of material in this text is based on the need to provide a solid introductory course for students in pure mathematics and in mathematical computer science. Naturally, the material is also heavily influenced by author's own interests.
http://www.math.ucsd.edu/~ebender/CombText/index.h
created by freebooksandarticles on 2008-07-07 04:50:41
|
|
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving.
http://www.macalester.edu/~hutchinson/book/book.ht
created by freebooksandarticles on 2008-07-07 04:52:47
|
|
This document is intended to be a short introduction to the field of queueing theory, serving as a module within the lecture Leistungsbewertung von Kommunikationsnetzen of Prof. Adam Wolisz from the Telecommunication Networks Group at Technical University Berlin.
http://www.tkn.tu-berlin.de/curricula/ws0203/ue-kn
created by freebooksandarticles on 2008-07-04 10:12:42
|
|
These lecture notes consist of several parts. The first part is an introduction to stochastic processes with an emphasis on business applications. There are chapters on the Poisson process, on queueing theory, inventory models, and so forth.
http://www.math.vu.nl/~koole/obp/
created by freebooksandarticles on 2008-07-04 10:04:38
|
|
The main topic of this book is the study of the behaviour in equilibrium of vector stochastic processes, or stochastic networks. Such processes have a wide range of applications: to give some examples, the components of the vector may represent queue sizes in a queueing network, gene frequencies in a population, or the condition of fruit trees in an orchard. When a stochastic network is reversible its analysis is greatly simplified, and the first chapter is devoted to a discussion of the concept of reversibility.
http://www.statslab.cam.ac.uk/~frank/BOOKS/kelly_b
created by freebooksandarticles on 2008-07-04 10:01:26
|
IndiaDiscuss.com : Social Bookmarkings and News Networking Site for India
RSS
Save Link 
Create/Add to List
