Sciweavers

108 search results - page 12 / 22
» Exact Exploration and Hanging Algorithms
Sort
View
ECML
2004
Springer
14 years 1 months ago
Filtered Reinforcement Learning
Reinforcement learning (RL) algorithms attempt to assign the credit for rewards to the actions that contributed to the reward. Thus far, credit assignment has been done in one of t...
Douglas Aberdeen
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 8 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
NEUROSCIENCE
2001
Springer
14 years 9 days ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 2 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
14 years 1 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh