Sciweavers

5889 search results - page 23 / 1178
» Graph Layout Problems
Sort
View
GD
2000
Springer
14 years 1 months ago
User Preference of Graph Layout Aesthetics: A UML Study
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
PROCEDIA
2010
344views more  PROCEDIA 2010»
13 years 8 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
JGAA
2002
99views more  JGAA 2002»
13 years 9 months ago
Graph Layout Aesthetics in UML Diagrams: User Preferences
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
PDPTA
2000
13 years 11 months ago
Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems
In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA an...
Shinya Watanabe, Tomoyuki Hiroyasu, Mitsunori Miki
TCAD
2002
110views more  TCAD 2002»
13 years 9 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...