๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

ON PREDICTING COMPUTATIONAL TIME OF A BRANCH AND BOUND ALGORITHM FOR THE ASSIGNMENT OF FACILITIES

โœ Scribed by Richard Mojena; Thomas E. Vollmann; Yoshihiro Okamoto


Book ID
109166587
Publisher
Decision Sciences Institute, Georgia State University
Year
1976
Tongue
English
Weight
546 KB
Volume
7
Category
Article
ISSN
0011-7315

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A fast algorithm for a k-NN classifier b
โœ Shin'ichiro Omachi; Hirotomo Aso ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB ๐Ÿ‘ 3 views

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the numb

Computational aspects and applications o
โœ Augustine O. Esogbue ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB

Fuzzy multistage derision processes are normally modelled and solved via fuzzy dynamic programming aigorithm$. We first review the field and present a branch and bound type alternative due to Kacprzyk. We next rectify some computational errors in Kacprzyk's example and show some examples from enviro