toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Type Feldman, J.; Sutherland, W.
  Title Rejuvenating Experimental Computer Science Type Journal Article
  Year 1979 Publication Communications of the ACM Abbreviated Journal  
  Volume 22 Issue 9 Pages 497-502  
  Keywords Feldman, Sutherland  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved no  
  Call Number refbase @ user @ FeldmanSutherland1979 Serial 7730  
Permanent link to this record
 

 
Publication Fischer, G.; Giaccardi, E.; Ye, Y.; Sutcliffe, A.G.; Mehandjiev, N.
  Title Meta-Design: A Manifesto for End-User Development Type Journal Article
  Year 2004 Publication Communications of the ACM Abbreviated Journal Meta-Design  
  Volume 47 Issue 9 Pages 33-37  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved no  
  Call Number refbase @ user @ Fischer2004 Serial 10042  
Permanent link to this record
 

 
Volume Fleckenstein, C.J.; David, H. openurl 
  Title Using a Global Name Space for Parallel Execution of UNIX Tools Type Journal Article
  Year 1989 Publication Communications of the ACM Abbreviated Journal  
  Volume 32 Issue 9 Pages 1085-1090  
  Keywords UNIX, Linda, make utility, generative communication, tuple space, IPC, operating systems, distributed processes, lightweight processes  
  Abstract The paper addresses the design and implementation of a parallel make utility under UNIX using distributed-programming language. Current languages designed for the use in distributed programming are not yet commonly available. The basic problems of distributed programming are the creation of processes having a disjoint physical address space, and the communication among them.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Communications of the ACM Approved no  
  Call Number refbase @ user @ PrivateCollection Serial 8966  
Permanent link to this record
 

 
Pages Floyd, R.W.
  Title The Paradigms of Programming Type Journal Article
  Year 1979 Publication Communications of the ACM Abbreviated Journal  
  Volume 22 Issue 8 Pages 455-460  
  Keywords Floyd  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved no  
  Call Number refbase @ user @ Floyd1979 Serial 7857  
Permanent link to this record
 

 
Abstract Freeman-Benson, B.N.; Maloney, J.; Borning, A. openurl 
  Title An Incremental Constraint Solver Type Journal Article
  Year 1990 Publication Communications of the ACM Abbreviated Journal  
  Volume 33 Issue 1 Pages 54-63  
  Keywords constraints, simulation, design, analysis, user interface support, reasoning support, geometric layout, CSP, DeltaBlue, walkabout strength, Agentsheets  
  Abstract Constraint programming language do not have the notion of control flow. In contrast to Model-View-Controller change/update mechanism (which is for example exploit in the INSIST simulation system) constraint programming requires no explicit notification messages in the code of the programmer. The focus of interest has shifted from interactive physics programming of ThingLab to user interface construction of ThingLab II. The big conceptual change was in introducing an incremental constraint satisfaction component to overcome the large latency time inherent to the compilation of plans into Smalltalk methods. This effort led to the design, proof and implementation of the delta blue algorithm. In order to achieve an efficient incremental algorithm the set of constraints had to be partitioned in a constraint hierarchy. It appears to be quite natural to differentiate several levels of preference in cognitive processes. Some constraints are pivotal while others are only mildly desired. ThingLab furnishes two basics classes: required constraints, and preferential constraints. The class of preferential constraints is dichotomized further into arbitrary levels of preference. A solution comparator called locally-predicate-better finds plausible solutions at reasonable computational costs. Four basic functions are provided to interface an application with the delta blue algorithm: • add a constraint • remove a constraint • add a variable • remove a variable Possible impact to my work: Even a not too sophisticated communication network of agents is likely to be computation-cost expensive. The incremental nature of refining an application iteratively should be reflected in a constraint model. After all, a user is not willing to accept batch-like behavior (e.g., to “recompile” a dependency network) for each single modification.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Communications of the ACM Approved no  
  Call Number refbase @ user @ personalACM Serial 8969  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: