685 search results - page 44 / 137 » Succinct Trees in Practice |
DAC
1994
ACM
13 years 11 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Although a lot of research efforts have been made in the minimization of the total power consumption caused by the clock tree, no attention has been paid to the minimization of th...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
AAAI
1996
13 years 9 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
EMNLP
2009
13 years 5 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...