246 search results - page 13 / 50 » Graph Structure Learning for Task Ordering |
142
click to vote
GECCO
2007
Springer
15 years 4 months 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]....
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
PRICAI
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
JSSPP
2010
Springer
14 years 7 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...