Sciweavers

3433 search results - page 438 / 687
» Heuristics for a bidding problem
Sort
View
COCOA
2009
Springer
15 years 10 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
15 years 10 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
AISC
2006
Springer
15 years 10 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
ATS
2004
IEEE
126views Hardware» more  ATS 2004»
15 years 10 months ago
Alternative Run-Length Coding through Scan Chain Reconfiguration for Joint Minimization of Test Data Volume and Power Consumptio
Test data volume and scan power are two major concerns in SoC test. In this paper we present an alternative run-length coding method through scan chain reconfiguration to reduce b...
Youhua Shi, Shinji Kimura, Nozomu Togawa, Masao Ya...
CASES
2004
ACM
15 years 10 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra