Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
System-level synthesis
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Hardware/Software CO-Design: Principles and Practice
Hardware/Software CO-Design: Principles and Practice
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
High Level Synthesis of Pipelined Datapaths
High Level Synthesis of Pipelined Datapaths
Hi-index | 0.00 |
In engineering application heuristics are widely used for discrete optimization tasks. We report two cases (in Dense Wavelength Division Multiplexing and High Level Synthesis), where a recent "intelligent" heuristic (STAGE) performs excellently by learning a value-function of the states. We have found that if a global structure of local minima is found by the function approximator then search time may not have to scale with the dimension of the problem in the exponent, but it may become a polynomial function of the dimension.