Sciweavers

6045 search results - page 302 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DAC
2008
ACM
15 years 9 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
GRID
2007
Springer
16 years 1 months ago
A robust PDE solver for the 3D Stokes/Navier-Stokes systems on the grid environment
Since grid computing provides users with more distributed computing and storage resources, it gives us an opportunity to design new efficient and robust solvers for the numerical...
Huidong Yang, Walter Zulehner, Ulrich Langer, Mark...
ERSA
2007
86views Hardware» more  ERSA 2007»
15 years 8 months ago
High-Precision BLAS on FPGA-enhanced Computers
The emergence of high-density reconfigurable hardware devices gives scientists and engineers an option to accelerating their numerical computing applications on low-cost but power...
Chuan He, Guan Qin, Richard E. Ewing, Wei Zhao
AP2PS
2009
IEEE
15 years 10 months ago
Algorithm-Based Fault Tolerance Applied to P2P Computing Networks
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance i...
Thomas Roche, Mathieu Cunche, Jean-Louis Roch
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha