Convergence results for ant routing algorithms viastochastic approximation
DOI10.1145/1755952.1755981zbMath1361.68013OpenAlexW2106541193MaRDI QIDQ2985881
John S. Baras, Punyaslok Purkayastha
Publication date: 10 May 2017
Published in: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1755952.1755981
Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- What's decidable about hybrid automata?
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Discrete-time control for rectangular hybrid automata
- Unfoldings: A partial-order approach to model checking.
- Marked directed graphs
- Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach
- Decentralized Control of Discrete-Event Systems With Bounded or Unbounded Delay Communication
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
This page was built for publication: Convergence results for ant routing algorithms viastochastic approximation
