Sciweavers

589 search results - page 91 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 1 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
80
Voted
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 5 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
14 years 10 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...
MASCOTS
2008
15 years 1 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
ICDCS
2005
IEEE
15 years 5 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer