Sciweavers

2504 search results - page 302 / 501
» Methods for comparing rankings of search engine results
Sort
View
107
Voted
TRECVID
2008
15 years 3 months ago
Oxford/IIIT TRECVID 2008 - Notebook paper
The Oxford/IIIT team participated in the high-level feature extraction and interactive search tasks. A vision only approach was used for both tasks, with no use of the text or aud...
James Philbin, Manuel J. Marín-Jimén...
ICDCS
2000
IEEE
15 years 6 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
ICML
2007
IEEE
16 years 2 months ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle
GECCO
2010
Springer
176views Optimization» more  GECCO 2010»
15 years 3 months ago
A hierarchical cooperative evolutionary algorithm
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Shelly Xiaonan Wu, Wolfgang Banzhaf
124
Voted
AIR
2004
134views more  AIR 2004»
15 years 1 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma