𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competitive Online Approximation of the Optimal Search Ratio

✍ Scribed by Fleischer, Rudolf; Kamphans, Tom; Klein, Rolf; Langetepe, Elmar; Trippen, Gerhard


Book ID
118180760
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
216 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Ant colony search algorithms for optimal
✍ Peng-Yeng Yin πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 390 KB

This paper presents a new polygonal approximation method using ant colony search algorithm. The problem is represented by a directed graph such that the objective of the original problem becomes to ΓΏnd the shortest closed circuit on the graph under the problem-speciΓΏc constraints. A number of artiΓΏc

The psychology of online searching
✍ Vigil, Peter J. πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 714 KB