Sciweavers

1541 search results - page 39 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
14 years 2 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
WWW
2009
ACM
14 years 10 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
ACL
2009
13 years 7 months ago
Learning with Annotation Noise
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...
Eyal Beigman, Beata Beigman Klebanov
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 3 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
IPPS
2000
IEEE
14 years 1 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco