Sciweavers

539 search results - page 21 / 108
» The N R One Time Password System
Sort
View
ENGL
2007
81views more  ENGL 2007»
13 years 7 months ago
Computational Comparisons of GPC and NGPC Schemes
—In this paper the GPC and NGPC model predictive control techniques are applied to a typical plant and compared in terms of computational efficiency. The system identification an...
D. N. Rao, M. R. K. Murthy, D. N. Harshal, S. R. M...
MST
2007
167views more  MST 2007»
13 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
EUROMICRO
2004
IEEE
13 years 11 months ago
Predicting Real-Time Properties of Component Assemblies: A Scenario-Simulation Approach
This paper addresses the problem of predicting timing properties of multi-tasking component assemblies during the design phase. For real-time applications, it is of vital importan...
Egor Bondarev, Johan Muskens, Peter H. N. de With,...
EUROMICRO
2004
IEEE
13 years 11 months ago
Towards Predicting Real-Time Properties of a Component Assembly
This paper addresses the prediction of timing properties of a component-based application already during the composition phase. At this stage, it is of vital importance to guarant...
Egor Bondarev, Peter H. N. de With, Michel R. V. C...
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
A note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
Tom Bohman, Alan M. Frieze, Eyal Lubetzky