Sharon Curtis  Home/Search
Context Related
| cs.stir.ac.uk/pub/users/...thesis.ps.gz comlab.ox.ac.uk/oucl/pub...thesis.ps.gz comlab.ox.ac.uk/pub/Docu...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.stir.ac.uk/~scu/res (more) From: comlab.ox.ac.uk/ou...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The main contribution of this thesis is a study of the dynamic programming and greedy strategies for solving combinatorial optimization problems. The study is carried out in the context of a calculus of relations, and generalises previous work by using a loop operator in the imperative programming style for generating feasible solutions, rather than the fold and unfold operators of the functional programming style. The relationship between fold operators and loop operators is explored, and it... (Update)
Context of citations to this paper: More
.... the ideas of problem structure and computation, and his ideas have been generalised by de Moor and Bird [6, 1] and later by Curtis [5]. Here, we apply these results to the setting of logic programs by showing how this approach can be used to answer these questions for...
...move is defined as a partial relation which yields value only when not both of x and y are empty. This was the view taken by Curtis in [10]. Once a specification is written in terms of a min R after a loop, theories in [10] are ready to transform it to a dynamic programming...
Cited by: More
Modal Kleene Algebra And Applications - A Survey - Desharnais, Möller, Struth (Correct)
Theory and Applications of Inverting Functions as Folds - Mu, Bird (Correct)
A Calculational Approach to Program Inversion - Linacre (2003) (Correct)
Active bibliography (related documents): More All
3.0: Dynamic Programming: a different perspective - Curtis (1997) (Correct)
2.3: The Greedy Algorithms Class: Formalization, Synthesis and.. - Charlier (1995) (Correct)
1.4: Use of Relational Operators for Algorithm Development - Curtis (1999) (Correct)
Similar documents based on text: More All
0.1: Grammar Learning Using Inductive Logic - Programming Stephen Pulman (Correct)
0.1: The Logic Of Reusable Propositional Output With The Fulfilment .. - van der Torre (1999) (Correct)
0.1: High Order Error Constants Of Clenshaw-Curtis Product Rules - Petras (Correct)
Related documents from co-citation: More All
3: Inversion of a recursive tree traversal (context) - Snepscheut - 1991
3: The Science of Programming (context) - Gries - 1981
3: van der Woude (context) - Backhouse, de Bruin et al. - 1991
BibTeX entry: (Update)
Sharon Curtis. A Relational Approach to Optimization Problems. PhD thesis, Computing Laboratory, Oxford University, 1995. http://citeseer.ist.psu.edu/curtis96relational.html More
@misc{ curtis95relational,
author = "S. Curtis",
title = "A Relational Approach to Optimization Problems",
text = "Sharon Curtis. A Relational Approach to Optimization Problems. PhD thesis,
Computing Laboratory, Oxford University, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/curtis96relational.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2732 Communicating Sequential Processes (context) - Hoare - 1995
338 A method for the construction of minimum redundancy codes (context) - Huffman - 1952
281 Information Processing Letters (context) - Zhou, Hoare et al. - 1992
270 The string-to-string correction problem (context) - Wagner, Fisher - 1974
232 Category theory for computing science (context) - Barr, Wells - 1990
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
180 Binary codes capable of correcting deletions (context) - Levenshtein - 1966
175 Shortest connection networks and some generalizations (context) - Prim - 1957
172 An introduction to the theory of lists (context) - Bird - 1987
138 Lectures on constructive functional programming (context) - Bird - 1988
109 Applied Dynamic Programming (context) - Bellman, Dreyfus - 1962
108 Journal of Symbolic Logic (context) - Tarski, calculus - 1941
92 Combinatorial Algorithms --- Theory and Practice (context) - Reingold, Nievergelt et al. - 1977
84 Law and Order in Algorithmics (context) - Fokkinga - 1992
84 Basic category theory for computer scientists (context) - Pierce - 1991
84 Princeton University Press (context) - Bellman - 1957
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
78 Software --- Practice and experience (context) - Knuth, Plass et al. - 1981
72 string edits and macromolecules: the theory and practice of .. (context) - Sankoff, Kruskal et al. - 1983
67 Programming From Specifications (context) - Morgan - 1994
63 Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
48 The representation of relational algebras (context) - Lyndon - 1950
48 The representation of relational algebras (context) - Lyndon - 1956
39 A typed lambda calculus with categorical type constructors (context) - Hagino - 1988
37 Some varieties containing relation algebras (context) - Maddux - 1982
36 The origin of relation algebras in the development and axiom.. - Maddux - 1991
32 Speeding up dynamic programming with applications to molecul.. (context) - Galil, Giancarlo - 1989
30 A dynamic programming approach to sequencing problems (context) - Held, Karp - 1962
26 A fixpoint theorem for complete categories (context) - Lambek - 1968
26 Topics in Relation Algebras (context) - Maddux - 1978
24 Category Theoretic Approach to Data Types (context) - Hagino - 1987
23 Matroids and the greedy algorithm (context) - Edmonds - 1971
22 Harvard University Press (context) - Peirce - 1933
22 Formal Aspects of Computing (context) - Bird, de Moor - 1993
21 the abstract properties of linear dependence (context) - Whitney - 1935
19 Dynamic Programming --- Models and Applications (context) - Denardo - 1982
17 From dynamic programming to greedy algorithms - Bird, de Moor - 1993
16 The representation of integral relation algebras (context) - McKenzie - 1970
16 Algorithms from P to NP (context) - Moret, Shapiro - 1991
15 Vorlesungen uber die Algebra der Logik (context) - Schroder
15 Available via anonymous ftp from ftp (context) - Aarts, Backhouse et al. - 1992
15 Solving optimisation problems with catamorphisms - Bird, de Moor - 1993
15 Finite-state processes and dynamic programming (context) - Karp, Held - 1967
13 Information Processing Letters (context) - von Karger, Hoare - 1995
13 Allegories of circuits - Brown, Jeffrey - 1994
12 The representation of relation algebras (context) - McKenzie - 1966
11 Designing circuits by calculation - Jones - 1990
11 allegories and circuit design (context) - Brown, Hutton - 1994
11 Common phrases and minimum-space text storage (context) - Wagner - 1973
11 The unification of three calculi (context) - Dijkstra - 1993
11 Introduction to Operations Research (context) - Ecker, Kupferschmid - 1988
10 and Rainer Schrader (context) - Korte, Lov'asz - 1991
10 Technical Monograph PRG (context) - de Moor, relations et al. - 1992
10 An exact characterization of greedy structures - Helman, Moret et al. - 1993
9 First steps towards the theory of rose trees (context) - Meertens - 1987
8 A time-interval calculus (context) - Brien - 1992
7 A graphical calculus - Curtis, Lowe - 1995
6 Mathematical structures underlying greedy algorithms (context) - Korte, Lov'asz - 1981
6 Relationen und Grafen (context) - Schmidt, Strohlein - 1988
6 Greedoids and linear objective functions (context) - Korte, Lov'asz - 1984
6 towards programming as a mathematical activity (context) - Meertens - 1993
5 A common schema for dynamic programming and branch and bound.. (context) - Helman - 1989
5 Between dynamic programming and greedy: Data compression - Bird, de Moor - 1992
5 Springer Verlag (context) - Freyd, Scedrov et al. - 1993
5 The principle of optimality in the design of efficient algor.. (context) - Helman - 1986
4 A comprehensive model of dynamic programming (context) - Helman, Rosenthal - 1985
4 Shorter paths to graph algorithms (context) - Moller, Russling - 1994
4 A theory of greedy structures based on k-ary dominance relat.. (context) - Helman - 1989
3 Algorithmic solution of the change-making problem (context) - Chang, Gill - 1970
3 Two greedy algorithms (context) - Bird - 1992
3 Automata and the problem of dynamic programming (context) - Shreider - 1961
3 A general scheme for breadth-first graph traversal - Russling - 1995
3 The change-making problem (context) - Wright - 1975
3 Solvable classes of discrete dynamic programming (context) - Ibaraki - 1973
3 Science of Computer Programming (context) - Curtis, Lowe et al. - 1996
3 A combinatorial optimization problem arising in dartboard de.. (context) - Eiselt, Laporte - 1991
3 Monotonicity and the principle of optimality (context) - Morin - 1982
2 Algebraic calculation of graph and sorting algorithms (context) - Moller - 1993
2 A relational derivation of a functional program - Hutton - 1992
2 Addison and Wesley (context) - Dijkstra, Feijen et al. - 1988
2 Canonical coin changing and greedy solutions (context) - Chang, Korsh - 1976
2 Institut fur mathematik (context) - Moller, graph et al. - 1993
2 in discrete dynamic programming (context) - Elmaghraby, of - 1970
2 Necessary and sufficient conditions for dynamic programming .. (context) - Bonzon - 1970
2 Institut fur mathematik (context) - Moller, algebra et al. - 1993
2 A simple program whose proof isn't (context) - Knuth - 1990
1 Re-designing the dartboard (context) - Selkirk - 1976
1 Book to appear (context) - Bird, de Moor et al. - 1996
1 A tool for relational programmers (context) - Hutton, Meijer et al. - 1994
1 Available by FTP from ftp (context) - Curtis - 1993
1 Bulletin of the Institute of Mathematics and its Application.. (context) - Singmaster, dartboard - 1980
1 A new look at Bellman's principle of optimality (context) - Sniedovich - 1986
1 All monotonic functors are relators (context) - Bird, de Moor - 1992
1 Praca Moravske Prirodovedecke Sploecnosti (context) - Jarn'ik, problemu - 1930
1 and Other Logical Writings (context) - de Morgan, Syllogism - 1966
1 Institut fur mathematik (context) - Russling, Technical et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.stir.ac.uk/~scu/res.html): More
Proofs with Graphs - Curtis, Lowe (1995) (Correct)
A Graphical Calculus - Curtis, Lowe (1995) (Correct)
Dynamic Programming: a different perspective - Curtis (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC