# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

#### Towards Intelligent Modeling

Springer 2011; US$ 159.00The main idea of statistical convergence is to demand convergence only for a majority of elements of a sequence. This method of convergence has been investigated in many fundamental areas of mathematics such as: measure theory, approximation theory, fuzzy logic theory, summability theory, and so on. In this monograph we consider this concept in approximating... more...

#### Probabilistic Combinatorial Optimization on Graphs

ISTE 2006; US$ 92.00This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Detailed discussion is given to a... more...

#### Random Walks, Boundaries and Spectra

Springer Basel 2011; US$ 169.00These proceedings represent the current state of research on the topics 'boundary theory' and 'spectral and probability theory' of random walks on infinite graphs. They are the result of the two workshops held in Styria (Graz and St. Kathrein am Offenegg, Austria) between June 29th and July 5th, 2009. Many of the participants joined both meetings.... more...

#### Lattice Path Counting and Applications

Elsevier Science 2014; US$ 72.95Probability and Mathematical Statistics: A Series of Monographs and Textbooks: Lattice Path Counting and Applications focuses on the principles, methodologies, and approaches involved in lattice path counting and applications, including vector representation, random walks, and rank order statistics. The book first underscores the simple and general... more...

#### Probabilistic Combinatorial Optimization on Graphs

Wiley 2013; US$ 150.00This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Those who possess a sound knowledge... more...

- 1
- Page