𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A more efficient global optimization algorithm based on Styblinski and Tang

✍ Scribed by Daniel C. Chin

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
114 KB
Volume
7
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Tabu Search based global optimizatio
New Tabu Search based global optimization methods outline of algorithms and study of efficiency
✍ Svetlana Stepanenko; Bernd Engels 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## Abstract The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu‐Search strategy, which tries to determine the global minimum of a function by the __steepest descent–mil

Global optimization based on a statistic
Global optimization based on a statistical model and simplicial partitioning
✍ A. Žilinskas; J. Žilinskas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 839 KB

A statistical model for global optimization is constructed generalizing some properties of the Wiener process to the multidimensional case. An approach to the construction of global optimization algorithms is developed using the proposed statistical model. The convergence of an algorithm based on th

Global-scale river routing—an efficient
Global-scale river routing—an efficient time-delay algorithm based on HydroSHEDS high-resolution hydrography
✍ L. Gong; S. Halldin; C.-Y. Xu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 557 KB

## Abstract Coupling of global hydrologic and atmospheric models is difficult because of the highly nonlinear hydrological processes to be integrated at large scales. Aggregation of high‐resolution data into low‐resolution spatial distribution functions is one way to preserve information and accoun

A new fast block matching algorithm base
A new fast block matching algorithm based on complexity-distortion optimization
✍ Pol Lin Tai; Chii Tung Liu; Jia Shung Wang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract Most fast block matching algorithms ignore the efficiency in motion compensation within each checking step. In order to achieve better‐compensated performance, the limited computational complexity should be allocated more carefully into each block. It means that the fast block matching