Sciweavers

206 search results - page 9 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
ANLP
1997
106views more  ANLP 1997»
15 years 1 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
91
Voted
SFM
2007
Springer
15 years 5 months ago
Tackling Large State Spaces in Performance Modelling
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
William J. Knottenbelt, Jeremy T. Bradley
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 4 months ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
ICML
2010
IEEE
15 years 22 days ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...
104
Voted
COLING
2008
15 years 1 months ago
Phrasal Segmentation Models for Statistical Machine Translation
Phrasal segmentation models define a mapping from the words of a sentence to sequences of translatable phrases. We discuss the estimation of these models from large quantities of ...
Graeme W. Blackwood, Adrià de Gispert, Will...