Our website is made possible by displaying online advertisements to our visitors.
Please consider supporting us by disabling your ad blocker.

Download links will be available after you disable the ad blocker and reload the page.

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration;... more...

In this book, the following three approaches to data analysis are presented:  - Test Theory, founded by Sergei V. Yablonskii (1924-1998); the first publications appeared in 1955 and 1958, -           Rough Sets, founded by Zdzisław I. Pawlak (1926-2006); the first publications appeared in 1981 and 1982, -           Logical... more...

Decision tree is a widely used form of representing algorithms and knowledge. Compact data models  and fast algorithms require optimization of tree complexity. This book is a research monograph on  average time complexity of decision trees. It generalizes several known results and considers a number of new problems.    The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time ... more...