Sciweavers

589 search results - page 111 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 5 days 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
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 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
WWW
2010
ACM
14 years 2 months ago
Equip tourists with knowledge mined from travelogues
With the prosperity of tourism and Web 2.0 technologies, more and more people have willingness to share their travel experiences on the Web (e.g., weblogs, forums, or Web 2.0 comm...
Qiang Hao, Rui Cai, Changhu Wang, Rong Xiao, Jiang...
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 1 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...