Sciweavers

685 search results - page 34 / 137
» Succinct Trees in Practice
Sort
View
AAAI
2010
13 years 9 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...
ILP
2005
Springer
14 years 1 months ago
Predicate Selection for Structural Decision Trees
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Kee Siong Ng, John W. Lloyd
ACL
2006
13 years 9 months ago
Extraction of Tree Adjoining Grammars from a Treebank for Korean
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some p...
Jungyeul Park
COLING
1996
13 years 9 months ago
Coordination in Tree Adjoining Grammars: Formalization and Implementation
In this paper we show that an account for coordination can be constructed usingthederivationstructures inalexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivat...
Anoop Sarkar, Aravind K. Joshi
INFORMS
2006
87views more  INFORMS 2006»
13 years 7 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...