✦ LIBER ✦

On a problem of tracking

✍ Scribed by N.N. Krasovskii

Publisher: Elsevier Science
Year: 1963
Tongue: English
Weight: 900 KB
Volume: 27
Category: Article
ISSN: 0021-8928
DOI: 10.1016/0021-8928(63)90006-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inverse stefan problem: Tracking of the

Inverse stefan problem: Tracking of the interface position from measurements on the solid phase

✍ C. Bénard; A. Afshari 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 782 KB

Kvoprosu upravleniya dvizheniem gusenich

Kvoprosu upravleniya dvizheniem gusenichnogo traktora (On the problem of steering a track-laying tractor): Nastenko, N.N. & Gurari, I.M.Trakt. i SelkhMash., 29, 1959

📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 72 KB

On the tracking problem

✍ L.S Gnoenskii 📂 Article 📅 1962 🏛 Elsevier Science 🌐 English ⚖ 528 KB

On a tracking problem for linear systems

✍ Yoichi Aoki 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 265 KB

On the eye tracking problem: a challenge

On the eye tracking problem: a challenge for robust control

✍ Allen Tannenbaum 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

Eye tracking is one of the key problems in controlled active vision. Because of modelling uncertainty and noise in the signals, it becomes a challenging problem for robust control. In this paper, we outline some of the key issues involved as well as some possible solutions. We will need to make cont

A Greedy On-Line Algorithm for thek-Trac

A Greedy On-Line Algorithm for thek-Track Assignment Problem

✍ U Faigle; W Kern; W.M Nawijn 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than Ž . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time