4128 search results - page 615 / 826 » Learning and using relational theories |
199
click to vote
ECML
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
191
click to vote
SIGIR
2004
ACM
16 years 21 days ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
185
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
216
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
188
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...