236 search results - page 26 / 48 » Learning Teleoreactive Logic Programs from Problem Solving |
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
AAAI
2004
13 years 8 months ago
2004
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...