829 search results - page 117 / 166 » Bandit Algorithms for Tree Search |
C3S2E
2010
ACM
14 years 11 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
CLEF
2005
Springer
15 years 3 months ago
2005
Springer
This year we participated at 4 Question Answering tasks at CLEF: the Italian monolingual (I), Italian-English (I/E), Bulgarian monolingual (B), and Bulgarian-English (B/E) bilingu...
WEBDB
2004
Springer
15 years 3 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
—The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in ...
61
Voted
AAAI
2000
14 years 11 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...