2446 search results - page 9 / 490 » Choiceless Polynomial Time |
128
Voted
ADMA
2006
Springer
15 years 9 months ago
2006
Springer
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
121
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
141
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
114
click to vote
WABI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
121
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...