Sciweavers

4377 search results - page 279 / 876
» Mass problems and randomness
Sort
View
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 11 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
ESANN
2004
15 years 8 months ago
Separability of analytic postnonlinear blind source separation with bounded sources
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
Fabian J. Theis, Peter Gruber
WSC
1998
15 years 8 months ago
Adaptive Stochastic Manpower Scheduling
Bayesian forecasting models provide distributional estimates for random parameters, and relative to classical schemes, have the advantage that they can rapidly capture changes in ...
Elmira Popova, David P. Morton
CPC
2006
116views more  CPC 2006»
15 years 6 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
JOC
2007
129views more  JOC 2007»
15 years 6 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng