✦ LIBER ✦

Algorithms for searching for hidden oscillations in the Aizerman and Kalman problems

✍ Scribed by G. A. Leonov; N. V. Kuznetsov

Book ID: 111455397
Publisher: SP MAIK Nauka/Interperiodica
Year: 2011
Tongue: English
Weight: 275 KB
Volume: 84
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562411040120

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online algorithms for searching and expl

Online algorithms for searching and exploration in the plane

✍ Subir Kumar Ghosh; Rolf Klein 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 453 KB

Searching for the hidden broad-line regi

Searching for the hidden broad-line region in Centaurus A

✍ D. M. Alexander; J. H. Hough; S. Young; J. A. Bailey; C. A. Heisler; S. L. Lumsd 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

An Efficient Quantum Algorithm for the H

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

✍ Gábor Ivanyos; Luc Sanselme; Miklos Santha 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 638 KB

Efficient local search algorithms for kn

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

✍ D. Karapetyan; G. Gutin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 594 KB

A parallel algorithm for the knapsack pr

A parallel algorithm for the knapsack problem using a generation and searching technique

✍ Henry Ker-Chang Chang; Jonathan Jen-Rong Chen; Shyong-Jian Shyu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 595 KB

A tabu search algorithm for the multi-tr

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

✍ José Brandão; Alan Mercer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 907 KB

This paper describes a novel tabu search heuristic for the multi-trip vehicle routing and scheduling problem (MTVRSP). The method was developed to tackle real distribution problems, taking into account most of the constraints that appear in practice. In the MTVRSP, besides the constraints that are c