Sciweavers

PPL
2000
91views more  PPL 2000»
13 years 11 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
PPL
2000
65views more  PPL 2000»
13 years 11 months ago
Deriving Process Networks from Nested Loop Algorithms
Edwin Rijpkema, Ed F. Deprettere, Bart Kienhuis
PPL
2000
93views more  PPL 2000»
13 years 11 months ago
Algorithmic Complexity with Page-Based Intelligent Memory
Mark Oskin, Lucian Vlad Lita, Frederic T. Chong, J...
PPL
2000
110views more  PPL 2000»
13 years 11 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna