Abstract
In engineering application heuristics are widely used for dis- crete optimization tasks.We report two cases (in DenseWavelength Divi- sion 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. P. Bertsekas. Network Optimization: Continuous and Discrete Models. Opimization and Neural Computation Series. Athena Scientific, Belmont, Massachusetts, 1998.
Editor D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston, 1995.
R. S. Sutton and A. G. Barto. Reinforcement learning: An introduction. MIT Pess, 1998.
Justin Andrew Boyan. Learning Evaluation Functions for Global Optimization. PhD dissertation, School of Computer Science, Carnegie Mellon University, Pittsburgh PA 15213, August 1998.
K. N. Sivarajan R. Ramaswami. Routing and wavelength assignment in alloptical networks. IEEE Transactions on Networking, 3(5):489–500, Oct. 1995.
P. Ashwood-Smith. Generalized mpls-signalling functional description. http://www.ietf.org/internet-drafts/.
I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: An approach to high bandwidth optical WANs. IEEE Transactions on Communications, 40(7):1171–1182, July 1992.
Tibor Cinkler. Heuristic algorithms for configuration of the ATM-layer over optical networks. In Proceedings of the ICC’97, IEEE International Conference on Communications, Montréal, pages 1164–1168, June 1997.
P. Arató, I. Jankovits, S. Szigeti, and T. Visegrády. High-level Synthesis of Pipelined Datapaths. PANEM, Budapest, 1999.
R. Camposano and W. Rosenstiel. Synthetizing circuits from behavioural descriptions. IEEE Transactions on Computer Aided Design, pages 171–180, 1989.
P. Arató, T. Kandár, Z. Mohr, and T. Visegrády. An algorithm for decomposition into predefined IP-s. Technical report, University of Budapest, 2000.
G. DeMicheli. Synthesis and Optimization of Digital Circuits. McGraw Hill, 1994.
J. Staunstrup and W. Wolf (eds). Hardware/Software Codesign: Principles and Practice. Kluwer Academic Publisher, 1997.
Rolf Ernst. Embedded System Architectures, System Level Synthesis, volume 357 of Nato Science Series. Kluwer Academic Publisher, 1999. Edited by A. A. Jerraya and J. Mermet.
Z. Palotai and A. Lörincz. Joint optimization of scheduling and allocation of IPs. manuscript in preparation.
B. Selman, H. A. Kautz, and B. Cohen. Local search strategies for satisfiability testing. Second DIMACS Challenge on Cliques, Coloring and Satisfiability, pages 44, 95-96, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ziegler, G., Palotai, Z., Cinkler, T., Arató, P., Lörincz, A. (2001). Value Prediction in Engineering Applications. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-45517-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42219-8
Online ISBN: 978-3-540-45517-2
eBook Packages: Springer Book Archive