- Author:
- Charles Matthew Geschke
No abstract available.
Cited By
- Zellweger P (1983). An interactive high-level debugger for control-flow optimized programs, ACM SIGSOFT Software Engineering Notes, 8:4, (159-172), Online publication date: 1-Aug-1983.
- Zellweger P (2019). An interactive high-level debugger for control-flow optimized programs, ACM SIGPLAN Notices, 18:8, (159-172), Online publication date: 1-Aug-1983.
- Zellweger P An interactive high-level debugger for control-flow optimized programs Proceedings of the symposium on High-level debugging, (159-172)
- Wile D (1983). Program developments, Communications of the ACM, 26:11, (902-911), Online publication date: 1-Nov-1983.
- Zellweger P An interactive high-level debugger for control-flow optimized programs (Summary) Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging, (159-171)
- Harbison S An architectural alternative to optimizing compilers Proceedings of the first international symposium on Architectural support for programming languages and operating systems, (57-65)
- Brooks R, Gabriel R and Steele G An optimizing compiler for lexically scoped LISP Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (261-275)
- Brooks R, Gabriel R and Steele G (2019). An optimizing compiler for lexically scoped LISP, ACM SIGPLAN Notices, 17:6, (261-275), Online publication date: 1-Jun-1982.
- Harbison S (2019). An architectural alternative to optimizing compilers, ACM SIGPLAN Notices, 17:4, (57-65), Online publication date: 1-Apr-1982.
- Harbison S (1982). An architectural alternative to optimizing compilers, ACM SIGARCH Computer Architecture News, 10:2, (57-65), Online publication date: 1-Mar-1982.
- Steele B Strategies for data abstraction in LISP Proceedings of the 1980 ACM conference on LISP and functional programming, (173-178)
- Reif J Symbolic program analysis in almost linear time Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (76-83)
- Atkinson R, Liskov B and Scheifler R Aspects Of Implementing CLU Proceedings of the 1978 annual conference, (123-129)
- Reif J and Lewis H Symbolic evaluation and the global value graph Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (104-118)
- Loveman D Program improvement by source to source transformation Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (140-152)
- Aho A and Ullman J Node listings for reducible flow graphs Proceedings of the seventh annual ACM symposium on Theory of computing, (177-185)
- Wile D (1973). A generative nested-sequential basis for general-purpose programming languages, ACM SIGPLAN Notices, 8:6, (96-98), Online publication date: 1-Jun-1973.
Recommendations
A new adaptive multi-start technique for combinatorial global optimizations
We analyze relationships among local minima for the traveling salesman and graph bisection problems under standard neighborhood structures. Our work reveals surprising correlations that suggest a globally convex, or ''big valley'' structure in these ...
Global optimizations and tabu search based on memory
Based on the idea of tabu search that Glover et al put forward, a new tabu search, named Memory Tabu Search (MTS), is proposed for solving the multiple-minima problem of continuous functions. Two convergence theorems, which show that MTS asymptotically ...
Global L-neighborhood groups
This paper introduces and studies the notion of global L-neighborhood group which is defined as a group equipped with a global L-neighborhood structure in sense of Gahler et al. such that both the binary operation and the unary operation of the inverse ...