Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction...

...

Even bad code can function. But if code isn’t clean, it can bring a development organization to its knees. Every year, countless hours and significant resources are lost because of poorly written code. But it doesn’t have to be that way.

Noted software expert Robert C. Martin presents a revolutionary paradigm with...

This new edition provides an up-to-date coverage of important theoretical models in the scheduling literature as well as  significant scheduling problems that occur in the real world. It again includes supplementary  material in the form of  slide-shows from industry and movies that...

Concurrent processes can exhibit extremely complicated behavior, and neither informal reasoning nor testing is reliable enough to establish their correctness. In this thesis, we develop a new technique for the verification of parallel programs. The technique is stated in terms of axioms and inference rules, and it is used to prove...

"This is a book about scheduling algorithms. … The book contains eleven chapters. … Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and...

The 19 revised full papers presented together with the abstracts of an invited talk and 2 tutorials were carefully reviewed and selected from 48 submissions. The papers are...