342 search results - page 45 / 69 » Using Decision Trees to Construct a Practical Parser |
CN
2008
13 years 8 months ago
2008
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
FLAIRS
2000
13 years 10 months ago
2000
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...