Sciweavers

722 search results - page 9 / 145
» Efficient Generation of Prime Numbers
Sort
View
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 4 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
APPT
2009
Springer
13 years 11 months ago
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
Pavel Emeliyanenko
FCCM
2006
IEEE
138views VLSI» more  FCCM 2006»
13 years 11 months ago
Efficient Hardware Generation of Random Variates with Arbitrary Distributions
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
David B. Thomas, Wayne Luk
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 26 days ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer