6943 search results - page 497 / 1389 » Representations for evolutionary algorithms |
184
Voted
ARITH
2003
IEEE
16 years 10 days ago
2003
IEEE
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
145
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
214
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
159
click to vote
ARITH
2005
IEEE
16 years 20 days ago
2005
IEEE
Efficient adder design requires proper selection of a recurrence algorithm and its realization. Each of the algorithms: Weinberger’s, Ling’s and Doran’s were analyzed for it...
131
click to vote
ICMCS
2005
IEEE
16 years 20 days ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...