✦ 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
DOI: 10.1137/060662204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithms for the online time s

Optimal algorithms for the online time series search problem

✍ Yinfeng Xu; Wenming Zhang; Feifeng Zheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

IN SEARCH OF AN OPTIMAL DEBT RATIO FOR E

IN SEARCH OF AN OPTIMAL DEBT RATIO FOR ECONOMIC GROWTH

✍ David J. Smyth; Yu Hsing 📂 Article 📅 1995 🏛 Oxford University Press 🌐 English ⚖ 624 KB

Optimal Sequential Sampling Policy of Pa

Optimal Sequential Sampling Policy of Partitioned Random Search and Its Approximation

✍ Z. B. Tang 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 651 KB

Ant colony search algorithms for optimal

Ant colony search algorithms for optimal polygonal approximation of plane curves

✍ 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

Local search, reducibility and approxima

Local search, reducibility and approximability of NP-optimization problems

✍ Giorgio Ausiello; Marco Protasi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 699 KB

The psychology of online searching

✍ Vigil, Peter J. 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 714 KB