829 search results - page 27 / 166 » Bandit Algorithms for Tree Search |
168
click to vote
NECO
2002
15 years 5 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
190
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
126
click to vote
ISCAS
2002
IEEE
15 years 10 months ago
2002
IEEE
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
175
click to vote
EACL
2009
ACL Anthology
15 years 3 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
178
click to vote
COCOA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...