Sciweavers

1083 search results - page 7 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
MEMOCODE
2006
IEEE
14 years 2 months ago
Mixed symbolic representations for model checking software programs
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
Zijiang Yang, Chao Wang, Aarti Gupta, Franjo Ivanc...
SSC
2007
Springer
147views Cryptology» more  SSC 2007»
14 years 2 months ago
Remarks on a Sequence of Minimal Niven Numbers
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
H. Fredricksen, E. J. Ionascu, Florian Luca, Pante...
DAC
2002
ACM
14 years 9 months ago
An integer linear programming based approach for parallelizing applications in On-chip multiprocessors
With energy consumption becoming one of the first-class optimization parameters in computer system design, compilation techniques that consider performance and energy simultaneous...
Ismail Kadayif, Mahmut T. Kandemir, Ugur Sezer
SARA
2009
Springer
14 years 3 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
STACS
2001
Springer
14 years 25 days ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel