Sciweavers

479 search results - page 48 / 96
» Learning to Improve both Efficiency and Quality of Planning
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
CEC
2007
IEEE
14 years 26 days ago
Double-deck elevator systems using Genetic Network Programming with reinforcement learning
Abstract-- In order to increase the transportation capability of elevator group systems in high-rise buildings without adding elevator installation space, double-deck elevator syst...
Jin Zhou, Lu Yu, Shingo Mabu, Kotaro Hirasawa, Jin...
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 10 months ago
Cluster Ensemble Selection
This paper studies the ensemble selection problem for unsupervised learning. Given a large library of different clustering solutions, our goal is to select a subset of solutions t...
Xiaoli Z. Fern, Wei Lin
PVLDB
2010
110views more  PVLDB 2010»
13 years 7 months ago
Evaluation of entity resolution approaches on real-world match problems
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
Hanna Köpcke, Andreas Thor, Erhard Rahm
IPPS
2010
IEEE
13 years 6 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...