𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constraint algorithm for singular Lagrangians subjected to nonholonomic constraints

✍ Scribed by de León, Manuel; de Diego, David Martı́n

Book ID
121849887
Publisher
American Institute of Physics
Year
1997
Tongue
English
Weight
335 KB
Volume
38
Category
Article
ISSN
0022-2488

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding a pat
An efficient algorithm for finding a path subject to two additive constraints
✍ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satis®es a number of QoS constraints. For two or more additive constraints, the problem of ®nding a feasible path is NP-complete that cannot be exactly solved