3600 search results - page 48 / 720 » The settling-time reducibility ordering |
HPDC
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a techn...
AMC
2005
13 years 10 months ago
2005
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
SCL
2010
13 years 8 months ago
2010
We discuss the use of Krylov subspace methods with regard to the problem of model order reduction. The focus lies on bilinear control systems, a special class of nonlinear systems...
ICCD
2001
IEEE
14 years 7 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
IJCNN
2007
IEEE
14 years 4 months ago
2007
IEEE
—A procedure is presented for selecting and ordering the polynomial basis functions in the functional link net (FLN). This procedure, based upon a modified Gram Schmidt orthonorm...