Sciweavers

932 search results - page 33 / 187
» Uniform Random Number Generators
Sort
View
IPCO
2007
126views Optimization» more  IPCO 2007»
14 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 2 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
RSA
2008
84views more  RSA 2008»
14 years 9 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
CEC
2009
IEEE
15 years 4 months ago
A clustering multi-objective evolutionary algorithm based on orthogonal and uniform design
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han...
JCT
2010
144views more  JCT 2010»
14 years 8 months ago
Combinatorics of generalized q-Euler numbers
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...
Tim Huber, Ae Ja Yee