81 |
Die Rolle der wesentlichen Restriktionen bei einem konvexen ProgramOettli, Karl Werner, January 1964 (has links)
Inaug.-Diss.--Zürich. / Vita. Includes bibliography.
|
82 |
Zur numerischen Behandlung von Versuchsplanungsproblemen für lineare Regressionsmodelle mit korrelierten BeobachtungenLinde-Ploumbidis, Angelika van der, January 1982 (has links)
Thesis (doctoral)--Freie Universität Berlin, 1982. / Description based on print version record. Includes bibliographical references.
|
83 |
New optimality conditions for integer programming and their application to test problem constructionFleisher, Jay Mark, January 1976 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references.
|
84 |
Searching for solutions of finite nonlinear systems an interval approach /Jones, Sandie T. January 1978 (has links)
Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 138-139).
|
85 |
Problems in designing digital systems using PLAsPatel, Pankaj. January 1977 (has links)
Thesis--Wisconsin. / Includes bibliographical references.
|
86 |
Decomposition methods for structured convex programmingHa, Cu Duong. January 1980 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1980. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 101-106).
|
87 |
A general model for computer simulation of sequential systemsBrandel, Robert F. January 1960 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1960. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 57).
|
88 |
Dynamic programming speedups /Zhang, Yan. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 92-101). Also available in electronic version.
|
89 |
Task Interaction and Control System (TICS) /Grossman, Mark, January 1987 (has links)
Thesis (Ph. D.)--Oregon Graduate Center, 1987.
|
90 |
Ordinal-theoretic properties of logic programsBagai, Rajiv 19 June 2018 (has links)
The work described in this dissertation is mainly a study of some ordinal-theoretic properties of logic programs that are related to the downward powers of their immediate-consequence functions. The downward powers for any program give rise to an interesting non-increasing sequence of interpretations, whose point of convergence is called the downward closure ordinal of that program. The last appearance of ground atoms that get eliminated somewhere in this sequence is called their downward order.
While it is well-known that there is no general procedure that can determine downward orders of atoms in any program, we present some rules for constructing such a procedure for a restricted class of programs.
Another existing result is that for every ordinal up to and including the least non-recursive ordinal [special characters omitted] there is a logic program having that ordinal as its downward closure ordinal. However, the literature contains only a few examples of programs, constructed in an ad hoc manner, with downward closure ordinal greater than the least transfinite ordinal (ω). We contribute to bridging this wide gap between the abstract and concrete knowledge by showing the connection between some of the existing examples and the well-known concept of the order of a vertex in a graph. Using this connection and a convenient notation system for ordinals involving ground terms as bases, we construct a family [special characters omitted] of logic programs where [special characters omitted] is the least fixpoint of the function λβ[ωβ] and any member Pα of the family has downward closure ordinal ω + α.
We also present an organization of a general transformation system, in which the objective is to search for transformations on syntax objects that satisfy pre-established semantic constraints. As desired transformations are not always guaranteed to exist, we present necessary and sufficient conditions for their existence. In this framework, we proceed to give transformations on logic programs for the successor and addition operations on their downward closure ordinals. / Graduate
|
Page generated in 0.0329 seconds