15485 search results - page 555 / 3097 » Computing Optimal Subsets |
200
click to vote
PPOPP
2005
ACM
16 years 18 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
242
click to vote
VECPAR
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
190
click to vote
CLOUD
2010
ACM
16 years 4 days ago
2010
ACM
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
188
click to vote
FCCM
2002
IEEE
16 years 15 hour ago
2002
IEEE
Several projects have developed compiler tools that translate high-level languages down to hardware description languages for mapping onto FPGAbased reconfigurable computers. Thes...
186
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...