| Brad Myers, Dario A. Giuse, Andrew Mickish, and David Kosbie. Making Structured Graphics and Constraints Practical for Large-Scale Applications. Submitted for Publication. |
....but one way constraints suffice for many applications and in general are more easily managed by programmers. Researchers have adopted various approaches to storage optimization for dataflow constraints. Constant propagation allows some constraints to be removed from the system completely [16, 17]. If all the parameters of a constraint are constant, the constraint can be evaluated and replaced with the constant result. The elimination of this constraint may permit the removal of other constraints as well. Since constraints often have multiple dependencies, the savings in a fairly static ....
MYERS, B. A., GIUSE, D. A., MICKISH, A., AND KOSBIE, D. Making structured graphics and constraints practical for large-scale applications. Tech. Rep. CMU-CS-94-150, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1994.
....are more powerful [4, 17, 19] but one way systems suffice for many applications and in general are more easily managed by programmers. Researchers have adopted various approaches to constraint optimization. Constant propagation allows some constraints to be removed from the system completely [12, 13]. If all the parameters of a constraint are constant, the constraint can be evaluated and replaced with the constant result. The elimination of this constraint may permit the removal of other constraints as well. Since constraints often have multiple dependencies, the savings in a fairly static ....
Myers, B. A., Giuse, D. A., Mickish, A., and Kosbie, D. Making structured graphics and constraints practical for large-scale applications. Tech. Rep. CMU-CS-94-150, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1994.
No context found.
Brad Myers, Dario A. Giuse, Andrew Mickish, and David Kosbie. Making Structured Graphics and Constraints Practical for Large-Scale Applications. Submitted for Publication.
....which are relationships that are declared once and maintained by the system, to tie objects values together. Amulet and Garnet al..so include many other innovations, which are described in various papers [Myers 1989] Myers 1990a] Vander Zanden 1990] Myers 1991b] Myers 1991a] Hashimoto 1992][Myers 1994][Vander Zanden 1994] Vander Zanden 1995b] Myers 1996a] Myers 1996b] Myers 1998] This chapter concentrates on the prototype instance object systems in Garnet and Amulet. In Garnet s and Amulet s prototype instance object systems, there is no concept of a class since every object can serve as a ....
....1K bytes. Thus, it would not be appropriate to use Garnet or Amulet objects if 100,000 were needed. Typical large Garnet and Amulet applications today would have 2000 to 5000 objects. We are investigating ways to provide glyphs [Calder 1990] which are very small objects for these situations [Myers 1994]. We have worked hard to provide a reasonable syntax for objects in C , but we are still not entirely happy. Beginners often have trouble with the syntax, and small slips and typos can result in unintelligible compiler error messages, or even worse, code which compiles but does unexpected ....
Brad A. Myers, Dario A. Giuse, Andrew Mickish and David S. Kosbie. Making Structured Graphics and Constraints Practical for Large-Scale Applications. Carnegie Mellon University Computer Science Department. CMU-CS-94150. May, 1994. Also appears as CMU-HCII-94-100.
No context found.
B. Myers, D. Giuse, A. Mickish, and D. Kosbie. Making structured graphics and constraints practical for large-scale applications. Technical Report CMU-CS-94-150, Carnegie Mellon University, Carnegie Mellon University, Pittsburgh, PA 15213, May 1994.
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