Algorithms Books

Self-stabilization is the property of a system guaranteeing that starting from an arbitrarty state, the system will return to a legitimate state in finite steps. Since proposed by Dr. Dijkstra in 1974, self-stabilization has been a desirable property in designing distributed systems, however this book is just the first one devoted to the introduction of this important concept. The book shows you how to appreciate the beautifulness of self-stabilization, and teaches you how to implement this property in distributed systems. A bunch of good examples are handy in the book for your guidance. I highly recommend this book to anyone who is interested in the area of distributed computing.

The book is of great depth and still wide in the diverse areas of data fusion.

Real world examples are picked up and related to data fusion technologies or methods.

It is a good start to the solution of any problem that deals with fusing information, of all types and sorts.

José Freitas - Madeira - Portugal

This book is fantastice. It starts basic and moves rapidly along to practical filter design. 100's of examples are given on the enclosed disk (in Matlab .m files). This means the reader can tinker around with each example until he understands the details. You can use the .m files to build your own simulations and filters. This is an excellent reference for the working engineer, or as a tutorial for the working engineer who needs to come up to speed on DSP.

The only draw back is YOU NEED MatLab to full utilize this book. If you are a student, you can pick up the acedemic version of MatLab for around $100. This works fine.

Stearns and David did our profession a big favor by writing this book. Thanks guys!

I found this to be a well written fast paced action thriller. The characters are well developed, and it is obvious that the author did his research. Michael Critchton came to mind as I was reading due to the techinical expertise the author exhibited in the field of computers. The settings were varied and provacative in their imagery. The plot was woven with enough twists and turns to hold my interest. I think it is an excellent first novel; and look forward to reading other works by Mr. Weissinger.

This book is very good for someone who is either new to the field or fairly experienced. Knuth is the king of computer algorithms !

Gourieroux & Monfort's (translated) 2-volume set has beautiful theory but at the same time lends itself to applications. The theory is intuitive, rigorous and fun to read. It also makes the connection between the theory and application understandable and meaningful (something that other books, e.g., Casella & Berger, fail to do). Highly recommended.

The Travelling Salesman Problem (more politically correctly called the Travelling Salesperson Problem)(How about we call it the TSP?) is a common real world problem. The problem is simplely stated: How do you find the shortest path for a travelling sales_____ to drive as he visits a series of customers.

If you're just running a few errands it's easy enough. If you're going to the supermarket, the post office, the dry cleaners, and the gas station, it's pretty easy to determine the shortest path. But then you add constraints, nearly out of gas, go to gas station first. Buying ice cream at the super market, better make it the last stop.

This is a real world problem. It is faced every day by delivery companies like the post office and air freight companies who spend huge amounts of fuel flying jet freighters around the world -- where do you put a hub, how do you schedule everything to come together.

FedEx solved this problem by running everything through Memphis. This works really well for a package going from New York to LA. It works less well for a package going from Manhattan to the Bronx. And if the package is going from London to Manchester ....

The computation of this and similar problems fall into the general category of Stochastic Local Search. And this book is the first to offer a systematic and unified treatment of SLS. Before this there were a series of technical papers, magazine articles and chapters in more general texts. The book provides the first unified view of the entire field and offers an extensive review of state-of-the-art algorithms and their applications. A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating the algorithms.

I'm one of the authors of this book, and I wanted to point out that this book comes with a CD-ROM full of animations illustrating the concepts.

Some of the animations are in the form of diagrams, while other animations are in the form of role-plays -- where people play the part of various elements of the data structure, illustrating how they interact.

Most books on this subject are dry and boring. To avoid this, we used an informal story-telling style, interjecting intersting stories and humour.

You can also check out the book's website at [...]

I'm one of the authors of this book, and I wanted to point out that this book comes with a CD-ROM full of animations illustrating the concepts.

Some of the animations are in the form of diagrams, while other animations are in the form of role-plays -- where people play the part of various elements of the data structure, illustrating how they interact.

Most books on this subject are dry and boring. To avoid this, we used an informal story-telling style, interjecting intersting stories and humour.

You can also check out the book's website at http://www.sdba.info

Good book on system dynamic modeling, especially for large dimension system and state space models.