311 search results - page 55 / 63 » Improving the performance of evolutionary algorithms for dec... |
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
IUI
2000
ACM
14 years 29 days ago
2000
ACM
Design problems involve issues of stylistic preference and flexible standards of success; human designers often proceed by intuition and are unaware of following any strict rule-b...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: Boosting is a general method for improving the accuracy of any given learning algorithm. In this paper we employ combination of Adaboost with Support Vector Machine (SVM) as comp...
NN
2010
Springer
13 years 7 months ago
2010
Springer
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
TCOM
2011
13 years 3 months ago
2011
—In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their...