Sciweavers

589 search results - page 72 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 10 days ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
RECOMB
1999
Springer
15 years 4 months ago
Classifying proteins by family using the product of correlated p-values
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...
Timothy L. Bailey, William Noble Grundy
HM
2007
Springer
155views Optimization» more  HM 2007»
15 years 3 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
WWW
2007
ACM
16 years 14 days ago
Query topic detection for reformulation
In this paper, we show that most multiple term queries include more than one topic and users usually reformulate their queries by topics instead of terms. In order to provide empi...
Xuefeng He, Jun Yan, Jinwen Ma, Ning Liu, Zheng Ch...
CP
2008
Springer
15 years 1 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus