Sciweavers

515 search results - page 67 / 103
» Layouts of Expander Graphs
Sort
View
DOCENG
2006
ACM
14 years 4 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
ECAL
2001
Springer
14 years 3 months ago
Amorphous Geometry
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
Ellie D'Hondt, Theo D'Hondt
ICS
2001
Tsinghua U.
14 years 3 months ago
Computer aided hand tuning (CAHT): "applying case-based reasoning to performance tuning"
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...
Antoine Monsifrot, François Bodin
GRID
2008
Springer
13 years 10 months ago
ADL: An Algorithm Definition Language for SmartGridSolve
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
Michele Guidolin, Alexey L. Lastovetsky
TCAD
2002
145views more  TCAD 2002»
13 years 10 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil