Sciweavers

71 search results - page 13 / 15
» Simple Monte Carlo and the Metropolis algorithm
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
13 years 11 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
ISLPED
2006
ACM
83views Hardware» more  ISLPED 2006»
14 years 6 days ago
Considering process variations during system-level power analysis
Process variations will increasingly impact the operational characteristics of integrated circuits in nanoscale semiconductor technologies. Researchers have proposed various desig...
Saumya Chandra, Kanishka Lahiri, Anand Raghunathan...
EOR
2010
125views more  EOR 2010»
13 years 6 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese
TOG
2008
125views more  TOG 2008»
13 years 6 months ago
Progressive photon mapping
This paper introduces a simple and robust progressive global illumination algorithm based on photon mapping. Progressive photon mapping is a multi-pass algorithm where the first p...
Toshiya Hachisuka, Shinji Ogaki, Henrik Wann Jense...
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
13 years 1 months ago
Time-synchronization in mobile sensor networks from difference measurements
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
Chenda Liao, Prabir Barooah