Sciweavers

209 search results - page 29 / 42
» Monte Carlo Go Has a Way to Go
Sort
View
ENC
2005
IEEE
15 years 5 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
JMLR
2010
202views more  JMLR 2010»
14 years 6 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 4 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
ESANN
2006
15 years 1 months ago
Dynamical reservoir properties as network effects
It has been proposed that chaos can serve as a reservoir providing an infinite number of dynamical states [1, 2, 3, 4, 5]. These can be interpreted as different behaviors, search a...
Carlos Lourenço
SPAA
2010
ACM
15 years 4 months ago
TLRW: return of the read-write lock
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible readers. In fact, no modern STM design locks to read along its common execution path b...
David Dice, Nir Shavit