1578 search results - page 242 / 316 » Algorithmic randomness of continuous functions |
COLT
1992
Springer
14 years 26 days ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
STOC
1995
ACM
14 years 9 days ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
NIPS
2001
13 years 10 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
CEC
2010
IEEE
13 years 10 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...