D. Stott Parker. Partial order programming. Technical Report CSD-870067, Computer Science Department, University of California, Los Angeles, CA, December 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finding Least Common Ancestors in Directed Acyclic Graphs - Bender, Pemmasani.. (2001) (Correct)
....is analyzed in various stages of compilation and execution. Objects are instances of classes organized in a partial order, and their inheritance depends on the temporal order in which the objects are de ned. The idea of formalizing object inheritance in lattice theoretic terms has been proposed by [AKBLN89, Fal90, Fal95, GR80, HN96, McA86, Par87] and others. There has even been considerable interest in further decomposing inheritance graphs into modules that are ecient to query [DH87, HHS95] The LCA operation is central to such object inheritance formalizations, because it is the natural method to resolve object dependence. Analysis ....
D.S. Parker. Partial order programming. Technical Report CSD-870067, Computer Science Department, UCLA, December 1987.
Extending HCLP with Partially Ordered Hierarchies and Composite.. - Chiu, Lee (1998) (Correct)
....[14] suggest to assign weights to individual combinations of values. Freuder [4] and Freuder and Wallace [5] propose a general model, partial constraint satisfaction problem (PCSP) for modeling overconstrained problems. Several such solving techniques as branch and bound are proposed. Parker [12] realizes that partial ordering can be used as a programming paradigm. In this paper, we pursue a general theory of partially ordered constraint hierarchy from the first principle. As far as we know, there is no previous work on the notion of composite constraints. We show how the partially ....
....constraints. Non required constraint solving algorithm may vary for different domains and comparators. For example, HCLP(R, 15] adapts a variant of the Simplex algorithm [11] in its constraint solver. 4 Limitations of HCLP Why should apples be better or worse than oranges D. Stott Parker [12] HCLP provides a framework to model constraint relaxations by declaring and ranking required and non required constraints under a constraint hierarchy. This framework, however, suffers from two limitations. First, all levels of constraints are totally ordered. Total ordering is unnecessary and ....
D.S. Parker. Partial order programming. Technical report, Computer Science Department, University of California, Los Angeles, CA 90024-1596, 1987.
Efficient Implementation of Lattice Operations - Ait-Kaci, Boyer, Lincoln, Nasr (1989) (6 citations) (Correct)
.... technique implementing the particular mechanism of object inheritance of LogIn [6] and further extended in Life [5] Another promising prospect of relevance for the techniques we describe seems to be the fast implementation of other constraint programming models strongly related to ours such as [13, 15, 16]. Section 2 states the problem in general terms. We first focus on the GLB operation, the most commonly used operation. Given that in arbitrary posets such an operation is not necessarily defined, Section 3 recalls a simple semi lattice embedding construction to palliate this. Then, a first method ....
Parker, D.S. Partial Order Programming. Technical Report CSD-870067, Computer Science Department, UCLA, Los Angeles, CA (December 1987).
Unknown - Symbolic Parallel Programming Self-citation (Programming Csd-) (Correct)
No context found.
D. Stott Parker. Partial order programming. Technical Report CSD-870067, Computer Science Department, University of California, Los Angeles, CA, December 1987.
Approximate Soft Shadows on Arbitrary Surfaces Using.. - Akenine-Möller, Assarsson (2002) (Correct)
No context found.
Parker, S., Shirley, P., and Smits, B., Single Sample Soft Shadows, TR UUCS-98-019, Computer Science Department, University of Utah, October 1998. 1, 2, 6
Efficient Implementation of Lattice Operations - Ait-Kaci, Boyer, Lincoln, Nasr (1989) (6 citations) (Correct)
No context found.
Parker, D.S. Partial Order Programming. Technical Report CSD-870067, Computer Science Department, UCLA, Los Angeles, CA (December 1987).
Approximate Soft Shadows on Arbitrary Surfaces using.. - Akenine-Möller, Assarsson (2002) (Correct)
No context found.
Parker, S., Shirley, P., and Smits, B., Single Sample Soft Shadows, TR UUCS-98-019, Computer Science Department, University of Utah, October 1998. 1, 2, 6
Approximate Soft Shadows on Arbitrary Surfaces using.. - Akenine-Möller, Assarsson (Correct)
No context found.
Parker, S., Shirley, P., and Smits, B., Single Sample Soft Shadows, TR UUCS-98-019, Computer Science Department, University of Utah, October 1998.
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