Name
Abstract | ||
|---|---|---|
A computer supported procedure is presented for using requirement information to prestructure component relationships for a general class of arrangement problems. The procedure generalizes and extends the range of admissable requirement information and reduces the risk of local optimality in arrangement. Three categories of requirements and implicit requirements. These three are integrated and used to organize the components to be arranged into a “normative structure” in the form of a semi-lattice hierarchy. The normative structure is an approximation of the spatial or temporal arrangement to be generated in real space. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1145/800139.804532 | Design Automation Conference |
Keywords | Field | DocType |
system arrangement problem,admissable requirement information,temporal arrangement,component relationship,arrangement problem,implicit requirement,local optimality,general class,requirement information,prestructuring model,procedure generalizes,normative structure,cost function,distributed computing,machinery,clustering algorithms,electronic circuits | Permission,Mathematical optimization,Computer science,Normative,Electronic engineering,Cluster analysis,Hierarchy | Conference |
ISBN | Citations | PageRank |
0-89791-020-6 | 3 | 0.56 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keiichi Sato | 1 | 8 | 2.79 |
| Charles L. Owen | 2 | 3 | 0.89 |