HEURISTICS FOR THE GLOBAL OPTIMIZATION OF MICROPROGRAMS.

被引：0
作者：
Poe, Michael D.
机构：
来源：
MICRO: Annual Microprogramming Workshop | 1980年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
24
引用
收藏
页码：13 / 12
相关论文
共 50 条
  • [31] Quantifying Heuristics in the Ordinal Optimization Framework
    Zhen Shen
    Qian-Chuan Zhao
    Qing-Shan Jia
    Discrete Event Dynamic Systems, 2010, 20 : 441 - 471
  • [32] New Optimization Functions for Potential Heuristics
    Seipp, Jendrik
    Pommerening, Florian
    Helmert, Malte
    PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2015, : 193 - 201
  • [33] PSO Heuristics Algorithm for Portfolio Optimization
    Chen, Yun
    Zhu, Hanhong
    ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS, 2010, 6145 : 183 - 190
  • [34] Meta-heuristics for portfolio optimization
    Kyle Erwin
    Andries Engelbrecht
    Soft Computing, 2023, 27 : 19045 - 19073
  • [35] On the Generalization of Neural Combinatorial Optimization Heuristics
    Manchanda, Sahil
    Michel, Sofia
    Drakulic, Darko
    Andreoli, Jean-Marc
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT V, 2023, 13717 : 426 - 442
  • [36] Comparison of Heuristics for Optimization of Association Rules
    Alsolami, Fawaz
    Amin, Talha
    Moshkov, Mikhail
    Zielosko, Beata
    Zabinski, Krzysztof
    FUNDAMENTA INFORMATICAE, 2019, 166 (01) : 1 - 14
  • [37] Analysis and Efficiency of Randomized Optimization Heuristics
    Lassig, Jorg
    IT-INFORMATION TECHNOLOGY, 2010, 52 (06): : 345 - 349
  • [38] Meta-heuristics for portfolio optimization
    Erwin, Kyle
    Engelbrecht, Andries
    SOFT COMPUTING, 2023, 27 (24) : 19045 - 19073
  • [39] Optimization Heuristics for Computing the Voronoi Skeleton
    Kotsur, Dmytro
    Tereshchenko, Vasyl
    COMPUTATIONAL SCIENCE - ICCS 2019, PT I, 2019, 11536 : 96 - 111
  • [40] HEURISTIC-SEARCH WITH GLOBAL AND LOCAL HEURISTICS
    MOLNAR, L
    NAVRAT, P
    VOJTEK, V
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (05): : 417 - 427
12345