Sciweavers

1639 search results - page 9 / 328
» Anytime Heuristic Search
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
KR
2004
Springer
14 years 25 days ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
HEURISTICS
2010
13 years 4 months ago
Human-guided search
Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitz...
HEURISTICS
2010
13 years 4 months ago
Alternating control tree search for knapsack/covering problems
Lars Magnus Hvattum, Halvard Arntzen, Arne L&oslas...
TSMC
2002
142views more  TSMC 2002»
13 years 7 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee