Sciweavers

1603 search results - page 95 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
120
Voted
DMIN
2007
214views Data Mining» more  DMIN 2007»
15 years 5 months ago
A Fast KNN Algorithm Based on Simulated Annealing
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
Chuanyao Yang, Yuqin Li, Chenghong Zhang, Yunfa Hu
JAIR
2011
173views more  JAIR 2011»
14 years 6 months ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
16 years 1 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
137
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
125
Voted
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 10 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon