829 search results - page 76 / 166 » Bandit Algorithms for Tree Search |
133
click to vote
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
103
click to vote
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
CCGRID
2009
IEEE
15 years 4 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...