797 search results - page 38 / 160 » Observing Success in the Pi-Calculus |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper analyses the reliability of confidence intervals for Koza's computational effort statistic. First, we conclude that dependence between the observed minimum generat...
UAI
2008
15 years 20 days ago
2008
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
AAAI
1998
15 years 18 days ago
1998
Weadvance a knowledge-based learning method that augments conventional generalization to permit concept acquisition in failure domains. These are domains in whichlearning must pro...
TREC
2003
15 years 18 days ago
2003
This paper presents Carnegie Mellon University’s experiments on the mixed named-page and homepage finding task of the TREC 12 Web Track. Our results were strong; we achieved the...
118
click to vote
NIPS
1992
15 years 12 days ago
1992
How can artificial neural nets generalize better from fewer examples? In order to generalize successfully, neural network learning methods typically require large training data se...