11910 search results - page 401 / 2382 » Online Learning Algorithms |
282
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
181
click to vote
ISCI
2008
15 years 6 months ago
2008
In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the ...
140
click to vote
AAAI
2007
15 years 9 months ago
2007
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
171
click to vote
AIME
2005
Springer
15 years 8 months ago
2005
Springer
In recent years, a few researchers have challenged past dogma and suggested methods (such as the IC algorithm) for inferring causal relationship among variables using steady state ...
171
click to vote
EGC
2005
Springer
16 years 6 days ago
2005
Springer
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is...