Sciweavers

475 search results - page 12 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
TKDE
2008
148views more  TKDE 2008»
13 years 7 months ago
Semisupervised Clustering with Metric Learning using Relative Comparisons
Semisupervised clustering algorithms partition a given data set using limited supervision from the user. The success of these algorithms depends on the type of supervision and also...
Nimit Kumar, Krishna Kummamuru
HEURISTICS
2008
170views more  HEURISTICS 2008»
13 years 7 months ago
Accelerating autonomous learning by using heuristic selection of actions
This paper investigates how to make improved action selection for online policy learning in robotic scenarios using reinforcement learning (RL) algorithms. Since finding control po...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...
AAAI
1998
13 years 8 months ago
Eye Finding via Face Detection for a Foveated Active Vision System
Eye finding is the first step toward building a machine that can recognize social cues, like eye contact and gaze direction, in a natural context. In this paper, we present a real...
Brian Scassellati
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
13 years 8 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
ICML
1995
IEEE
14 years 8 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo