2 search results - page 1 / 1 » Inducing Partially-Defined Instances with Evolutionary Algor... |
ICML
2001
IEEE
14 years 5 months ago
2001
IEEE
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...