Sciweavers

949 search results - page 77 / 190
» Can Doxastic Agents Learn
Sort
View
82
Voted
ICANN
2005
Springer
15 years 6 months ago
Short Term Memories and Forcing the Re-use of Knowledge for Generalization
Despite the well-known performances and the theoretical power of neural networks, learning and generalizing are sometimes very difficult. In this article, we investigate how short ...
Laurent Orseau
AAAI
2006
15 years 2 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
Meinolf Sellmann, Carlos Ansótegui
118
Voted
AAAI
2011
14 years 25 days ago
Trajectory Regression on Road Networks
This paper addresses the task of trajectory cost prediction, a new learning task for trajectories. The goal of this task is to predict the cost for an arbitrary (possibly unknown)...
Tsuyoshi Idé, Masashi Sugiyama
116
Voted
AAAI
2011
14 years 24 days ago
Tree Sequence Kernel for Natural Language
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
Jun Sun, Min Zhang, Chew Lim Tan
AAAI
2012
13 years 3 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole