Sciweavers

8486 search results - page 40 / 1698
» Ordered Enumeration Method
Sort
View
ISCA
2008
IEEE
134views Hardware» more  ISCA 2008»
14 years 2 months ago
Achieving Out-of-Order Performance with Almost In-Order Complexity
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they...
Francis Tseng, Yale N. Patt
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 8 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
TCS
2008
13 years 7 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
ASIACRYPT
2010
Springer
13 years 5 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...