136 search results - page 19 / 28 » Using Rewarding Mechanisms for Improving Branching Heuristic... |
NAACL
1994
13 years 8 months ago
1994
Current MT systems, whatever translation method they at present employ, do not reach an optimum output on free text. Our hypothesis for the experiment reported in this paper is th...
DICS
2006
13 years 11 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
VL
1995
IEEE
13 years 11 months ago
1995
IEEE
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
BC
2002
13 years 7 months ago
2002
Abstract. Sensory experience alters the functional organization of cortical networks. Previous studies using behavioral training motivated by aversive or rewarding stimuli have dem...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
Control-flow misprediction penalties are a major impediment to high performance in wide-issue superscalar processors. In this paper we present Selective Eager Execution (SEE), an ...