Sciweavers

36 search results - page 4 / 8
» Programming Manifolds
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
13 years 11 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
HPCN
2000
Springer
13 years 11 months ago
Modelling Control Systems in an Event-Driven Coordination Language
The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures f...
Theophilos A. Limniotes, George A. Papadopoulos
DAC
2005
ACM
14 years 8 months ago
Robust gate sizing by geometric programming
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
Jaskirat Singh, Vidyasagar Nookala, Zhi-Quan Luo, ...
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
TCAD
2008
136views more  TCAD 2008»
13 years 7 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar