Sciweavers

1594 search results - page 107 / 319
» Fast Prediction on a Tree
Sort
View
VLSID
1993
IEEE
114views VLSI» more  VLSID 1993»
14 years 7 days ago
A Methodology for Generating Application Specific Tree Multipliers
Low latency, application, specific multipliers are required for m,any DSP algorithms. Tree multipliers are an obvious answer to this requirement. However, tree architectures have ...
S. Ramanathan, Nibedita Mohanty, V. Visvanathan
AIIDE
2008
13 years 10 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 9 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
INTERSPEECH
2010
13 years 2 months ago
Modeling pronunciation variation with context-dependent articulatory feature decision trees
We consider the problem of predicting the surface pronunciations of a word in conversational speech, using a model of pronunciation variation based on articulatory features. We bu...
Sam Bowman, Karen Livescu
AUTOMATICA
1999
66views more  AUTOMATICA 1999»
13 years 7 months ago
Fast switches in relay feedback systems
Relays are common in automatic control systems. Even linear systems with relay feedback are, however, far from fully understood. New results are given about the behavior of these ...
Karl Henrik Johansson, Anders Rantzer, Karl Johan ...