1950 search results - page 58 / 390 » Varieties of Increasing Trees |
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ICALP
1990
Springer
14 years 24 days ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
AAAI
2006
13 years 10 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
TOIS
2002
13 years 8 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...