Sciweavers

3600 search results - page 6 / 720
» The settling-time reducibility ordering
Sort
View
AMC
2005
112views more  AMC 2005»
13 years 7 months ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang
CCE
2004
13 years 7 months ago
On the use of reduced order models in bifurcation analysis of distributed parameter systems
Bifurcation theory provides a powerful tool for analyzing the nonlinear dynamic behavior of process systems. However, although the theory in principle applies to lumped as well as...
Yi Liu, Elling W. Jacobsen
VLSISP
2008
104views more  VLSISP 2008»
13 years 7 months ago
Guidance of Loop Ordering for Reduced Memory Usage in Signal Processing Applications
Data dominated signal processing applications are typically described using large and multi-dimensional arrays and loop nests. The order of production and consumption of array ele...
Per Gunnar Kjeldsberg, Francky Catthoor, Sven Verd...
DAC
1998
ACM
14 years 8 months ago
A Mixed Nodal-Mesh Formulation for Efficient Extraction and Passive Reduced-Order Modeling of 3D Interconnects
As VLSI circuit speeds have increased, reliable chip and system design can no longer be performed without accurate threedimensional interconnect models. In this paper, we describe...
Nuno Alexandre Marques, Mattan Kamon, Jacob White,...
CGO
2009
IEEE
14 years 2 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...