829 search results - page 22 / 166 » Bandit Algorithms for Tree Search |
AUSAI
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
TCAD
2010
13 years 2 months ago
2010
In this paper, we present DeFer--a fast, high-quality, scalable, and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a nonslicing floorplan by compacting a sli...
ECAI
2004
Springer
14 years 24 days ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
DAGSTUHL
2007
13 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
ICAISC
2004
Springer
14 years 24 days ago
2004
Springer
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to searc...