5055 search results - page 13 / 1011 » Relative Timing |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
TFS
2008
13 years 8 months ago
2008
When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper, we propose a framework to represent, compute, and re...
CAV
1994
Springer
14 years 17 days ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
ICPADS
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
CTRSA
2006
Springer
14 years 4 days ago
2006
Springer
In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desmedt [12]. We use several additional obs...