Algorithm theories and design tactics
Tóm tắt
Từ khóa
Tài liệu tham khảo
Baumert, 1971, Cyclic Difference Sets
Bird, 1987, A calculus of functions for program derivation
Dijkstra, 1976
Goguen, 1988, Introducing OBJ3
Ibaraki, 1978, Branch-and-bound procedures and state space representation of combinatorial optimization problems, Inform. and Control, 36, 1, 10.1016/S0019-9958(78)90197-3
Karp, 1967, Finite state processes and dynamic programming, SIAM J. Appl. Math., 15, 693, 10.1137/0115060
Lowry, 1987, Algorithm synthesis through problem reformulation, Proceedings Sixth National Conference on Artificial Intelligence (AAAI-87)
Lowry, 1989, Algorithm synthesis through problem reformulation
Manna, 1980, A deductive approach to program synthesis, ACM Trans. Programming Languages Syst., 2, 90, 10.1145/357084.357090
Mitten, 1973, Implicit enumeration procedures
Nau, 1984, General branch and bound and its relation to A∗ and AO∗, Artificial Intelligence, 23, 29, 10.1016/0004-3702(84)90004-3
Paige, 1982, Finite differencing of computable expressions, ACM Trans. Programming Languages Syst., 4, 402, 10.1145/357172.357177
Skinner, 1988, X-ray imaging with coded masks, Sci. Amer., 259, 84, 10.1038/scientificamerican0888-84
Smith, 1983, The structure of divide-and-conquer algorithms
Smith, 1985, Top-down synthesis of divide-and-conquer algorithms, Artificial Intelligence, 27, 43, 10.1016/0004-3702(85)90083-9
Smith, 1987, Applications of a strategy for designing divide-and-conquer algorithms, Sci. Comput. Programming, 8, 213, 10.1016/0167-6423(87)90034-7
D.R. Smith, Structure and design of global search algorithms, Acta Inform. (to appear)
1987
D.R. Smith, KIDS: A semi-automatic program development system, IEEE Trans. Software Engrg. (to appear).
D.R. Smith, Structure and design of dynamic programming algorithms. Tech. Rept., Kestrel Institute, Palo Alto, CA (to appear).
Smith, 1988, Knowledge-based software development tools, 79