Sciweavers

6409 search results - page 384 / 1282
» A Computational Algorithm for Origami Design
Sort
View
DAC
2006
ACM
16 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
SIGCOMM
2012
ACM
13 years 9 months ago
Network-aware service placement in a distributed cloud environment
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
Moritz Steiner, Bob Gaglianello Gaglianello, Vijay...
IPPS
2010
IEEE
15 years 4 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
16 years 3 months ago
From molecular interactions to gates: a systematic approach
The continuous minituarization of integrated circuits may reach atomic scales in a couple of decades. Some researchers have already built simple computation engines by manipulatin...
Josep Carmona, Jordi Cortadella, Yousuke Takada, F...
260
Voted
PLDI
1993
ACM
15 years 10 months ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam