311 search results - page 36 / 63 » Learning first-order probabilistic models with combining rul... |
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
114
click to vote
IJHIS
2006
14 years 11 months ago
2006
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary ...
152
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
ISIPTA
2003
IEEE
15 years 5 months ago
2003
IEEE
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...