Sciweavers

2593 search results - page 16 / 519
» On Two Problems of Nano-PLA Design
Sort
View
TPDS
1998
71views more  TPDS 1998»
14 years 11 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
ICCD
1995
IEEE
100views Hardware» more  ICCD 1995»
15 years 2 months ago
Transformation of min-max optimization to least-square estimation and application to interconnect design optimization
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
ENTCS
2002
207views more  ENTCS 2002»
14 years 11 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
CDC
2009
IEEE
227views Control Systems» more  CDC 2009»
14 years 9 months ago
Reduced-order observer design using a Lagrangian method
This paper considers the problem of reduced-order observer design. A design procedure is proposed in which the impulse response of the observer is treated as the solution of a gene...
Mark Mutsaers, Siep Weiland, Richard Engelaar
CCR
2005
129views more  CCR 2005»
14 years 11 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft