4894 search results - page 237 / 979 » Choices |
209
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
208
click to vote
AIPS
2008
15 years 9 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
186
click to vote
EDM
2008
15 years 8 months ago
2008
Bayesian graphical models are commonly used to build student models from data. A number of standard algorithms are available to train Bayesian models from student skills assessment...
222
click to vote
NIPS
2000
15 years 8 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
208
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...