Sciweavers

722 search results - page 14 / 145
» Efficient Generation of Prime Numbers
Sort
View
ICCAD
2000
IEEE
148views Hardware» more  ICCAD 2000»
13 years 12 months ago
FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders
—As the complexity of digital filters is dominated by the number of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the co...
Hyeong-Ju Kang, Hansoo Kim, In-Cheol Park
ECOOP
2007
Springer
13 years 11 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
KES
2008
Springer
13 years 7 months ago
IRPS - An Efficient Test Data Generation Strategy for Pairwise Testing
Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to e...
Mohammed I. Younis, Kamal Zuhairi Zamli, Nor Ashid...
CN
2010
111views more  CN 2010»
13 years 7 months ago
HPC5: An efficient topology generation mechanism for Gnutella networks
Abstract. In this paper, we propose a completely distributed topology generation mechanism named HPC5 for Gnutella network. A Gnutella topology will be efficient and scalable if it...
Joydeep Chandra, Santosh Kumar Shaw, Niloy Ganguly
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
13 years 11 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres