Sciweavers

1016 search results - page 94 / 204
» Generalized distances between rankings
Sort
View
GECCO
2008
Springer
165views Optimization» more  GECCO 2008»
15 years 2 months ago
Dual-population genetic algorithm for nonstationary optimization
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
Taejin Park, Ri Choe, Kwang Ryel Ryu
SIAMREV
2010
140views more  SIAMREV 2010»
14 years 8 months ago
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Yves Lucet
ISPD
2012
ACM
248views Hardware» more  ISPD 2012»
13 years 8 months ago
A fast estimation of SRAM failure rate using probability collectives
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
Fang Gong, Sina Basir-Kazeruni, Lara Dolecek, Lei ...
ECCV
2004
Springer
16 years 3 months ago
Stretching Bayesian Learning in the Relevance Feedback of Image Retrieval
This paper is about the work on user relevance feedback in image retrieval. We take this problem as a standard two-class pattern classification problem aiming at refining the retri...
Ruofei Zhang, Zhongfei (Mark) Zhang
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 6 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle