✦ LIBER ✦

Solving Multiconstraint Assignment Problems Using Learning Automata

✍ Scribed by Horn, G.; Oommen, B.J.

Book ID: 117939064
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 912 KB
Volume: 40
Category: Article
ISSN: 1083-4419
DOI: 10.1109/tsmcb.2009.2032528

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Continuous learning automata solutions t

Continuous learning automata solutions to the capacity assignment problem

✍ Oommen, B.J.; Roberts, T.D. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 325 KB

Discretized learning automata solutions

Discretized learning automata solutions to the capacity assignment problem for prioritized networks

✍ Oommen, B.J.; Roberts, T.D. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 517 KB

Solving a Unification Problem under Cons

Solving a Unification Problem under Constrained Substitutions Using Tree Automata

✍ YUICHI KAJI; TORU FUJIWARA; TADAO KASAMI 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 875 KB

A unification problem under constrained substitutions, a generalization of the usual unification problems, is a useful formalization of a practical problem in which there are some constraints on operations and objects that we can use. In this paper, a procedure to solve the problem under some linear

Solving the generalised assignment probl

Solving the generalised assignment problem using polyhedral results

✍ Dirk Cattrysse; Zeger Degraeve; Jurgen Tistaert 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 657 KB

SOLVING DYNAMIC WILDLIFE RESOURCE OPTIMI

SOLVING DYNAMIC WILDLIFE RESOURCE OPTIMIZATION PROBLEMS USING REINFORCEMENT LEARNING

✍ CHRISTOPHER J. FONNESBECK 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

Solving the flight gate assignment probl

Solving the flight gate assignment problem using dynamic programming

✍ Florian Jaehn 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 413 KB