829 search results - page 4 / 166 » Bandit Algorithms for Tree Search |
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
COMCOM
2010
13 years 6 months ago
2010
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
JCB
2006
13 years 7 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
SSS
2009
Springer
14 years 1 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...