47 search results - page 3 / 10 » Meta-learning for Fast Incremental Learning |
ICRA
2000
IEEE
13 years 9 months ago
2000
IEEE
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
ITNG
2010
IEEE
13 years 10 months ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
ASPDAC
2005
ACM
13 years 7 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...