Sciweavers

1914 search results - page 302 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 8 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)and (1 + 2)-Evolution-Strategies (ESs) with the aim of designing fa...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
154
Voted
KBSE
2010
IEEE
15 years 2 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
148
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 4 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
131
Voted
KBSE
2009
IEEE
15 years 10 months ago
Alattin: Mining Alternative Patterns for Detecting Neglected Conditions
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...
Suresh Thummalapenta, Tao Xie
247
Voted
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
14 years 3 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek