Reinforcement learning for solving shortest-path and dynamic scheduling problems

Stefán, P. and Monostori, László and Erdélyi, F. (2001) Reinforcement learning for solving shortest-path and dynamic scheduling problems. In: Proceedings of the 3rd international workshop on emergent synthesis. IWES'01 Bled, 2001..

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:08
Last Modified: 11 Dec 2012 15:08
URI: https://eprints.sztaki.hu/id/eprint/2672

Update Item Update Item